Skip to main content
SpringerLink
Log in

A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints

  • Short Communication
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

This paper is concerned with two-machine no-wait flow shop scheduling problems in which the actual processing time of each job is a proportional function of its starting time and each machine may have non-availability intervals. The objective is to minimize the makespan. We assume that the non-availability intervals are imposed on only one machine. Moreover, the number of non-availability intervals, the start time and end time of each interval are known in advance. We show that the problem with a single non-availability interval is NP-hard in the ordinary sense and the problem with an arbitrary number of non-availability intervals is NP-hard in the strong sense.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Alidaee B., Womer N.K.: Scheduling with time dependent processing times: review and extensions. J. Oper. Res. Soc. 50, 711–720 (1999)

    MATH  Google Scholar 

  2. Browne S., Yechiali U.: Scheduling deteriorating jobs on a single processor. Oper. Res. 38, 495–498 (1990)

    Article  MATH  Google Scholar 

  3. Cheng T.C.E., Ding Q., Lin B.M.T.: A concise survey of scheduling with time-dependent processing times. Eur. J. Oper. Res. 152, 1–13 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  4. Cheng T.C.E., Liu Z.: Approximability of two-machine no-wait flow shop scheduling with availability constraints. Oper. Res. Lett. 31, 319–322 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Espinouse M.L., Formanovicz P., Penz B.: Complexity results and approximation algorithms for the two-machine no-wait flow shop with limited machine availability. J. Oper. Res. Soc. 52, 116–121 (2001)

    Article  MATH  Google Scholar 

  6. Floudas, C.A., Pardalos, P.M. (eds): Encyclopedia of Optimization, 2nd edn. Springer, Berlin (2009)

    MATH  Google Scholar 

  7. Gawiejnowicz S.: Scheduling deteriorating jobs subject to job or machine availability constraints. Eur. J. Oper. Res. 180, 472–478 (2007)

    Article  MATH  Google Scholar 

  8. Gawiejnowicz S.: Time-Dependent Scheduling. Springer-Verlag, Berlin (2008)

    MATH  Google Scholar 

  9. Hsu, C.-J., Yang, S.-J., Yang, D.-L.: Due-date assignment and optional maintenance activity scheduling problem with linear deteriorating jobs. J. Mar. Sci. Technol. (2010, in press)

  10. Ji M., He Y., Cheng T.C.E.: Scheduling linear deteriorating jobs with availability constraint on a single machine. Theor. Comput. Sci. 362, 115–126 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  11. Johnson D.S.: The NP-completeness column: an ongoing guide. J. Algorithms 2, 393–405 (1982)

    Article  Google Scholar 

  12. Kononov A., Gawiejnowicz S.: NP-hard cases in scheduling deteriorating jobs on dedicated machines. J. Oper. Res. Soc. 52, 708–717 (2001)

    Article  MATH  Google Scholar 

  13. Lee C.-Y.: Minimizing the makespan in the two-machine flow shop scheduling problem with an availability constraint. Oper. Res. Lett. 20, 129–139 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  14. Mosheiov G.: Scheduling jobs under simple linear deterioration. Comput. Oper. Res. 21, 653–659 (1994)

    Article  MATH  Google Scholar 

  15. Mosheiov G.: Complexity analysis of job-shop scheduling with deteriorating jobs. Discrete Appl. Math. 117, 195–209 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  16. Pardalos, P.M., Resende, M.G.C. (eds.): Handbook of Applied Optimization. Oxford University Press (2002)

  17. Wang G., Cheng T.C.E.: Heuristics for two-machine no-wait flow shop scheduling with an availability constraints. Inf. Process. Lett. 80, 305–309 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  18. Wu C.-C., Lee W.-C.: Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine. Inf. Process. Lett. 87, 89–93 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  19. Yang S.-J., Yang D.-L., Cheng T.C.E.: Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance. Comput. Oper. Res. 37, 1510–1514 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  20. Yang, S.-J., Yang, D.-L.: Minimizing the makespan on single-machine scheduling with aging effect and variable maintenance activities. Omega Int. J. Manag. Sci. (2010). doi:10.1016/j.omega.2010.01.003

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and Systems Science, Shenyang Normal University, Shenyang, 110034, Liaoning, People’s Republic of China

    Chuanli Zhao & Hengyong Tang

Authors
  1. Chuanli Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hengyong Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chuanli Zhao.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhao, C., Tang, H. A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints. Optim Lett 5, 183–190 (2011). https://doi.org/10.1007/s11590-010-0202-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-010-0202-1

Keywords

Search

Navigation