Skip to main content
SpringerLink
Log in

Makespan minimization for two parallel machines with an unavailable period on each machine

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

Abstract

In this paper, we consider a two parallel machine problem where each machine has a fixed and known unavailable period. The objective is to minimize the makespan. In the literature, the problem has been considered for the case in which there is only one unavailable period on either one of the machines. This paper extends the results to two unavailable periods, one for each machine. For each of the different cases of the problem, an algorithm is developed to find the optimal solution. Although all the proposed algorithms have exponential time complexities, they are quite efficient in solving large problems. Computational results for problems with up to 1000 jobs are reported.

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. Lee CY (1999) Two-machine flowshop scheduling with availability constraints. Eur J Oper Res 114:420–429

    Article  MATH  Google Scholar 

  2. Park Y, Kim S, Lee YH (2000) Scheduling jobs on parallel machines applying neural network and heuristic rules. Comput Ind Eng 38:189–202

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Kellerer H (1998) Algorithms for multiprocessor scheduling with machine release times. IIE Trans 30:991–999

    Article  Google Scholar 

  6. Lee CY, Liman SD (1993) Capacitated two-parallel machines scheduling to minimize sum of job completion times. Discrete Appl Math 41:211–222

    Article  MATH  MathSciNet  Google Scholar 

  7. Mosheiov G (1994) Minimizing the sum of job completion on capacitated parallel machines. Math Comput Model 20:91–99

    Article  MATH  Google Scholar 

  8. Lee CY, Chen ZL (2000) Scheduling jobs and maintenance activities on parallel machines. Nav Res Log 47:145–165

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Liao CJ, Shyur DL, Lin CH (2005) Makespan minimization for two parallel machines with an availability constraint. Eur J Oper Res 160:445–456

    Article  MATH  Google Scholar 

  11. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco

    MATH  Google Scholar 

  12. Ho JC, Wong JS (1995) Makespan minimization for m parallel identical processors. Nav Res Log 42:935–948

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Management, National Taiwan University of Science and Technology, Taipei, Taiwan, Republic of China

    Chien-Hung Lin & Ching-Jong Liao

  2. Department of International Trade, Jin Wen Institute of Technology, 99 An-Chung Road, Hsin-Tien, 231, Taipei County, Taiwan, Republic of China

    Chien-Hung Lin

Authors
  1. Chien-Hung Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ching-Jong Liao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chien-Hung Lin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lin, CH., Liao, CJ. Makespan minimization for two parallel machines with an unavailable period on each machine. Int J Adv Manuf Technol 33, 1024–1030 (2007). https://doi.org/10.1007/s00170-006-0524-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-006-0524-4

Keywords

Search

Navigation