Skip to main content

Advertisement

SpringerLink
Log in

Parallel machine scheduling with earliness-tardiness penalties and space limits

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

Abstract

In order to maximize an availability of machine and utilization of space, the parallel machines scheduling problem with space limit is frequently discussed in the industrial field. In this paper, we consider the parallel machine scheduling problem in which n jobs having different release times, due dates, and space limits are to be scheduled on m parallel machines. The objective function is to minimize the weighted sum of earliness and tardiness. To solve this problem, a heuristic is developed which is divided into three modules hierarchically: job selection, machine selection and job sequencing, and solution improvement. To illustrate its effectiveness, a proposed heuristic is compared with genetic algorithm (GA), hybrid genetic algorithm (HGA), and tabu search (TS), which are well-known meta-heuristics in a large number of randomly generated test problems based on the field situation. Also, we determine the job selection rule that is suitable to the problem situation considered in this paper and show the effectiveness of our heuristic method.

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. Pinedo M (1997) Scheduling theory and systems. Prentice-Hall, Saddlewood, NJ

    Google Scholar 

  2. Cheng TCE, Sin CCS (1990) A state-of-the-art review of parallel-machine scheduling research. Eur J Oper Res 47(3):271–292

    Article  MATH  MathSciNet  Google Scholar 

  3. Cheng TCE, Chen Z-L (1994) Parallel-machine scheduling problems with earliness and tardiness penalties. J Oper Res Soc 45(6):685–695

    Article  MATH  MathSciNet  Google Scholar 

  4. Cheng R, Gen M, Tozawa T (1995) Minmax earliness/tardiness scheduling in identical parallel machine system using genetic algorithms. Comput Ind Eng 29(1–4):513–517

    Article  Google Scholar 

  5. Adamopoulos GI, Pappis CP (1998) Scheduling under a common due-date on parallel unrelated machines. Eur J Oper Res 105(3):494–501

    Article  MATH  Google Scholar 

  6. Biskup D, Cheng TCE (1999) Multiple-machine scheduling with earliness, tardiness and completion time penalty. Comput Oper Res 26(1):45–57

    Article  MATH  MathSciNet  Google Scholar 

  7. Chen Z-L, Powell WB (1999) A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem. Eur J Oper Res 116(1):220–232

    Article  MATH  MathSciNet  Google Scholar 

  8. Chen Z-L, Lee C-Y (2002) Parallel machine scheduling with a common due window. Eur J Oper Res 136(3):512–527

    Article  MATH  MathSciNet  Google Scholar 

  9. Sun H, Wang G (2003) Parallel machine earliness and tardiness scheduling with proportional weights. Comput Oper Res 30(5):801–808

    Article  MATH  Google Scholar 

  10. Lee W-C, Wu C-C, Chan P (2006) A simulated annealing approach to makespan minimization on identical parallel machines. Int J Adv Manuf Technol 31(3–4):328–334

    Article  Google Scholar 

  11. Zhang Z, Zheng L, Weng MX (2007) Dynamic parallel machine scheduling with mean weighted tardiness objective by Q-Learning. Int J Adv Manuf Technol (in press). DOI 10.1007/s00170-006-0662-8

  12. Hu P-C (2006) Further study of minimizing total tardiness for the worker assignment scheduling problem in the identical parallel-machine models. Int J Adv Manuf Technol 29(1–2):165–169

    Article  Google Scholar 

  13. Lin C-H, Liao C-J (2007) Makespan minimization for two parallel machines with an unavailable period on each machine. Int J Adv Manuf Technol (in press) DOI 10.1007/s00170-006-0524-4

  14. Chen J-F (2006) Minimization of maximum tardiness on unrelated parallel machines with process restrictions and setups. Int J Adv Manuf Technol 29(5):557–563

    Article  Google Scholar 

  15. Rajkumar S, Arunachalam VP, Selladurai V (2007) Workflow balancing in parallel machines through genetic algorithm. Int J Adv Manuf Technol (in press) DOI 10.1007/s00170-006-0553-z

  16. Ventura JA, Kim D (2003) Parallel machine scheduling with earliness-tardiness penalties and additional resource constraints. Comput Oper Res 30(13):1945–1958

    Article  MATH  MathSciNet  Google Scholar 

  17. Sivrikaya-Serifoglu F, Ulusoy G (1999) Parallel machine scheduling with earliness and tardiness penalties. Comput Oper Res 26(8):773–787

    Article  MATH  MathSciNet  Google Scholar 

  18. Balakrishnan N, Kanet JJ, Sridharan SV (1999) Early/tardy scheduling with sequence dependent setups on uniform parallel machines. Comput Oper Res 26(2):127–141

    Article  MATH  MathSciNet  Google Scholar 

  19. 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 

  20. Lee CY, Choi JY (1995) A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights. Comput Oper Res 22(8):857–869

    Article  MATH  MathSciNet  Google Scholar 

  21. Gen M, Cheng R (1997) Genetic algorithms and engineering design. Wiley-Interscience, New York

    Google Scholar 

  22. Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, New York

    MATH  Google Scholar 

  23. Kim YK, Yoon BS, Lee SB (1996) Meta heuristic. Young Ji Publishing Co, Seoul

    Google Scholar 

  24. Glover F (1989) Tabu search-part I. ORSA J Comput 1(3):190–206

    MATH  Google Scholar 

  25. Glover F (1989) Tabu search-part II. ORSA J Comput 2(1):4–32

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial and Information Engineering, Yonsei University, 134, Sinchon, Seodaemun, Seoul, South Korea

    Suk Jae Jeong & Kyung Sup Kim

Authors
  1. Suk Jae Jeong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kyung Sup Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Suk Jae Jeong.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jeong, S.J., Kim, K.S. Parallel machine scheduling with earliness-tardiness penalties and space limits. Int J Adv Manuf Technol 37, 793–802 (2008). https://doi.org/10.1007/s00170-007-1027-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-007-1027-7

Keywords

Search

Navigation