Skip to main content
SpringerLink
Log in

Optimal parallel machines scheduling with machine availability and eligibility constraints

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

In reality, the machine might become unavailable due to machine breakdowns or various inevitable reasons, and machine might have different capability to processing job. Motivated by this, we consider the problem of scheduling n non-preemptive and independent jobs on m identical machines incorporating machine availability and eligibility constraints while minimizing the maximum lateness. Each machine is capable of processing at specific availability intervals. We develop a branch and bound algorithm applying several immediate selection rules for solving this scheduling problem.

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

Similar content being viewed by others

References

  1. Blazewicz J, Ecker K, Pesch E, Schmidt G, Weglarz J (2001) Scheduling computer and manufacturing processes (Second Edition). Springer, Berlin Heidelberg New York

    Google Scholar 

  2. Blazewicz J, Ecker K, Schmidt G, Weglarz J (1993) Scheduling in computer and manufacturing systems. Springer, Berlin Heidelberg New York

    MATH  Google Scholar 

  3. Schmidt G (1984) Scheduling on semi-identical processors. Zeitschrift für Oper Res A28:153–162

    Article  Google Scholar 

  4. Schmidt G (1988) Scheduling independent tasks with deadlines on semi-identical processors. J Oper Res Soc 39:271–277

    Article  MATH  Google Scholar 

  5. Blazewicz J, Drozdowski M, Formanowicz P, Kubiak W, Schmidt G (2000) Scheduling preemptable tasks on parallel processors with limited availability. Parallel Comput 26:1195–1211

    Article  MathSciNet  Google Scholar 

  6. Lee CY, Lei L, Pinedo M (1997) Current trends in deterministic scheduling. Ann Oper Res 70:1–41

    Article  MATH  MathSciNet  Google Scholar 

  7. Sanlaville E, Schmidt G (1998) Machine scheduling with availability constraints. Acta Informatica 35:795–811

    Article  MATH  MathSciNet  Google Scholar 

  8. Schmidt G (2000) Scheduling with limited machine availability. Eur J Oper Res 121:1–15

    Article  MATH  Google Scholar 

  9. Liu Z, Sanlaville E (1995) Profile scheduling of list algorithm. In: Chretienne P et al. (eds). Scheduling theory and its applications. Wiley, New York, pp 91–110

    Google Scholar 

  10. Centeno G, Armacost RL (1997) Parallel machine scheduling with release time and machine eligibility restrictions. Comput Ind Eng 33(1–2): 273–276

    Article  Google Scholar 

  11. Centeno G, Armacost RL (2004) Minimizing makespan on parallel machines with release time and machine eligibility restrictions. Int J Prod Res 42(6):1243–1256

    Article  MATH  Google Scholar 

  12. Graham RL, Lawer EL, Lenstra JK, Rinnooy Ken AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5: 287–326

    Article  MATH  MathSciNet  Google Scholar 

  13. Hwang HC, Chang SY (1998) Parallel machines scheduling with machine shutdowns. Comput Math App 36(3): 21–31

    Article  MATH  MathSciNet  Google Scholar 

  14. Hwang HC, Lee K, Chang SY (2005) The effect of machine availability on the worst-case performance. Discrete Appl Math 148:49–61

    Article  MATH  MathSciNet  Google Scholar 

  15. Kellerer H (1998) Algorithm for multiprocessor scheduling with machine release time. IIE Trans 30:991–999

    Google Scholar 

  16. Lee CY (1991) Parallel machines scheduling with nonsimultaneous machine available time. Discrete Appl Math 30:53–61

    Article  MATH  MathSciNet  Google Scholar 

  17. Lee CY (1996) Machine scheduling with an availability constraint. J Global Optim 9:395–416

    Article  MATH  MathSciNet  Google Scholar 

  18. Lee CY, He Y, Tang G (2000) A note on “parallel machine scheduling with non-simultaneous machine available time”. Discrete Appl Math 100:133–135

    Article  MATH  MathSciNet  Google Scholar 

  19. Gharbi A, Haouari M (2005) Optimal parallel machines scheduling with availability constraints. Discrete Appl Math 148:63–87

    Article  MATH  MathSciNet  Google Scholar 

  20. Wu CC, Lee WC (2006) A note on single-machine scheduling with learning effect and an availability constraint. Int J Adv Manuf Technol DOI 10.1007/s00170-006-0469-7

  21. Sanlaville E (1995) Nearly on line scheduling of preemptive independent tasks. Discrete Appl Math 57: 229–241

    Article  MATH  MathSciNet  Google Scholar 

  22. Horn WA (1974) Some simple scheduling algorithms. Nav Res Log Quarterly 21:177–185

    Article  MATH  MathSciNet  Google Scholar 

  23. Labetoulle J, Lawler EL, Lenstra JK, Rinnoy Kan AHG (1984) Preemptive scheduling of uniform machines subject to release dates. In: Pulleyblank WR (eds). Progress in combinatorial optimization. Academic Press, New York, pp. 245–261

    Google Scholar 

  24. Pinedo M (2002) Scheduling: theory, algorithm and system (Second Edition). Prentice Hall, New Jersey

    Google Scholar 

  25. Lin Y, Li W (2004) Parallel machine scheduling of machine-dependent jobs with unit-length. Eur J Oper Res 156:261–266

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Industrial Management, National Central University, No.300, Jhongda Rd., Jhongli City, Taoyuan County, 32001, Taiwan, Republic of China

    Gwo-Ji Sheen, Lu-Wen Liao & Cheng-Feng Lin

Authors
  1. Gwo-Ji Sheen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lu-Wen Liao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Cheng-Feng Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gwo-Ji Sheen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sheen, GJ., Liao, LW. & Lin, CF. Optimal parallel machines scheduling with machine availability and eligibility constraints. Int J Adv Manuf Technol 36, 132–139 (2008). https://doi.org/10.1007/s00170-006-0810-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-006-0810-1

Keywords

Search

Navigation