Skip to main content
SpringerLink
Log in

Scheduling on identical parallel machines to minimize total completion time with deadline and machine eligibility constraints

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

Abstract

This study addresses the identical parallel machine scheduling problem with job deadlines and machine eligibility constraints to minimize total job completion time. Jobs must be completed before or at a deadline and preemptions are not allowed. Every job is allowed to be processed on a specified subset of machines. This problem is NP-hard. A heuristic and a branch and bound algorithm are developed to solve the problem. For the branch and bound algorithm, a lower bound based on the dual solution of the assignment problem is proposed and the heuristic serves as the initial upper bound. Many dominance rules are developed to curtail the branching nodes during the search procedure. Computational results indicate that the lower bound improves the performance of those in the literature in terms of execution time, and heuristic consistently generates a good quality schedule.

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. Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287–326

    Article  MATH  MathSciNet  Google Scholar 

  2. Kim CQ, Shin HJ (2003) Scheduling jobs on parallel machines: a restricted tabu search approach. Int J Adv Manuf Technol 22:278–287

    Article  Google Scholar 

  3. Hu PC (2005) Minimizing total flow time for the worker assignment scheduling problem in the identical parallel-machine models. Int J Adv Manuf Technol 25:1046–1052

    Article  Google Scholar 

  4. Hu PC (2006) Further study of minimizing total flowtime for the worker assignment scheduling problem in the identical parallel-machine models. Int J Adv Manuf Technol 29:753–757

    Article  Google Scholar 

  5. Azizgolu M (2003) Preemptive scheduling on identical parallel machines subject to deadlines. Eur J Oper Res 148:205–210

    Article  Google Scholar 

  6. Smith WE (1956) Various optimizers for single-stage production. Nav Res Logist Q 3:59–66

    Article  Google Scholar 

  7. Bagchi U, Ahmadi RH (1987) An improved lower bound for minimizing weighted completion times with deadlines. Oper Res 35(2):311–313

    Article  MATH  MathSciNet  Google Scholar 

  8. Posner ME (1985) Minimizing weighted completion times with deadlines. Oper Res 33(3):562–574

    Article  MATH  MathSciNet  Google Scholar 

  9. Lenstra JK, Rinnooy Kan AHG, Brucker P (1977) Complexity of machine scheduling problem. Ann Discrete Math 1:343–362

    Article  MathSciNet  Google Scholar 

  10. Pinedo ML (2002) Scheduling: theory, algorithms, and systems, 2nd edn. Prentice-Hall, Englewood Cliffs, NY

    MATH  Google Scholar 

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

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

  13. Li CL (2006) Scheduling unit-length jobs with machine eligibility restrictions. Eur J Oper Res 174:1325–1328

    Article  MATH  Google Scholar 

  14. Garey MR, Johnson DS (1976) Scheduling tasks with nonuniform deadlines on two processors. J Assoc Comput Mach 23(3):461–467

    MATH  MathSciNet  Google Scholar 

  15. Lo ZP, Bavarian B (1991) Job scheduling on parallel machine using simulated annealing. IEEE:391–396

  16. Leung JYT, Pinedo M (2003) Minimizing total completion time with parallel machines with deadline constraints. SIAM J Comput 32(5):1370–1388

    Article  MATH  MathSciNet  Google Scholar 

  17. Gonzalez TF, Leung JYT, Pinedo M (2006) Minimizing total completion time on uniform machines with deadline constraints. ACM Trans on Algorithm 2(1):95–115

    Article  MathSciNet  Google Scholar 

  18. Liaw CF, Lin YK, Cheng CY, Chen MC (2003) Scheduling unrelated parallel machines to minimize total weighted tardiness. Comput Oper Res 30:1777–1789

    Article  MATH  MathSciNet  Google Scholar 

  19. Rajendran C, Ziegler H (2001) A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs. Eur J Oper Res 131:622–634

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Chung-Yuan Christian University, Chung-Li, Taiwan, Republic of China

    Ling-Huey Su

Authors
  1. Ling-Huey Su
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ling-Huey Su.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Su, LH. Scheduling on identical parallel machines to minimize total completion time with deadline and machine eligibility constraints. Int J Adv Manuf Technol 40, 572–581 (2009). https://doi.org/10.1007/s00170-007-1369-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-007-1369-1

Keywords

Search

Navigation