Skip to main content
SpringerLink
Log in

Solution approaches for a real-life resource-constrained parallel machine scheduling problem

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

Abstract

This paper deals with a real-world scheduling problem in an injection-molding department of an electrical appliance plant. In the department, a resource-constrained parallel machine scheduling problem with machine eligibility restrictions is investigated. First, an integer-programming (IP) model with the objective of minimizing makespan is developed for the entire problem. Since this entire IP model has a huge number of variables, it cannot handle the problem efficiently. To obtain more efficient results, two solution approaches, namely IP/IP and IP/constraint programming (CP) both of which partition the entire problem into loading and scheduling sub-problems, are proposed. The loading phase, in which an IP loading model assigns the jobs to machines with the aim of minimizing maximum load on the machines and operators, is the same for both approaches. Subsequently, in the scheduling phase, the IP/IP approach uses an IP scheduling model while the IP/CP approach applies a CP scheduling model to obtain the final schedule of the jobs. Computational results show that the proposed solution methods improve makespan values for almost all test problems in comparison to the entire IP model. In particular, the IP/IP approach performs better in the test problems with greater number of operators, whereas IP/CP approach provides quick and practical results in almost all test problems and gives relatively more efficient makespan values when the resource constraints are tight (i.e., the case of smaller number of operators).

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. Ventura JA, Kim D (2003) Parallel machine scheduling with earliness–tardiness penalties and additional resource constraints. Comput Oper Res 30:1945–1958

    Article  MathSciNet  MATH  Google Scholar 

  2. Pinedo M (1995) Scheduling theory, algorithms and systems. Prentice Hall, Upper Saddle River

    MATH  Google Scholar 

  3. Daniels RL, Hua SY, Webster S (1999) Heuristics for parallel-machine flexible-resource scheduling problems with unspecified job assignment. Comput Oper Res 26:143–155

    Article  MATH  Google Scholar 

  4. Lustig IJ, Puget JF (2001) Program does not equal program: constraint programming and its relationship to mathematical programming. Interfaces 31(6):29–53

    Google Scholar 

  5. Focacci F, Lodi A, Milano M (2002) Mathematical programming techniques in constraint programming: a short overview. J Heuristics 8:7–17

    Article  MATH  Google Scholar 

  6. Heipcke S (1999) Comparing constraint programming and mathematical programming approaches to discrete optimization—the change problem. J Oper Res Soc 50:581–595

    MATH  Google Scholar 

  7. Smith BM, Brailsford SC, Hubbard PM, Williams HP (1997) The progressive party problem: integer linear programming and constraint programming compared. Constraints 1:119–138

    Article  MathSciNet  Google Scholar 

  8. Darbi-Dowman KD, Little J (1998) Properties of some combinatorial optimization problems and their effect on the performance of integer programming and constraint logic programming. INFORMS J Comput 10(3):276–286

    Article  MathSciNet  Google Scholar 

  9. Darbi-Dowman KD, Little J, Mitra G, Zaffalon M (1997) Constraint logic programming and integer programming approaches and their collaboration in solving an assignment scheduling problem. Constraints 1:245–264

    Article  MathSciNet  Google Scholar 

  10. Edis EB, Ozkarahan I (2011) A combined integer/constraint programming approach to a resource-constrained parallel machine scheduling problem with machine eligibility restrictions. Eng Optimiz 43(2):135–157

    Article  MathSciNet  Google Scholar 

  11. Hooker JN (2005) A hybrid method for planning and scheduling. Constraints 10:385–401

    Article  MathSciNet  MATH  Google Scholar 

  12. Hooker JN (2006) An integrated method for planning and scheduling to minimize tardiness. Constraints 11:139–157

    Article  MathSciNet  MATH  Google Scholar 

  13. Chu Y, Xia Q (2005) A hybrid algorithm for a class of resource-constrained scheduling problems. In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems, second international conference (CPAIOR’2005). Lecture notes in computer science 3524. Springer, Prague, pp 110–124

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

    Article  MATH  Google Scholar 

  15. Mokotoff E (2001) Parallel machine scheduling problems: a survey. Asia Pac J Oper Res 18:193–242

    MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  17. Centeno R, 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 

  18. Salem A, Anagnostopoulos GC, Rabadi, G (2000) A branch-and-bound algorithm for parallel machine scheduling problems. Proceeding of harbour, maritime & multimodal logistics modeling and simulation workshop, a publication of the Society for Computer Simulation International (SCS), Portofino, pp 88–93

  19. Vairaktarakis GL, Cai X (2003) The value of processing flexibility in multipurpose machines. IIE Trans 35:763–774

    Article  Google Scholar 

  20. Blazewicz J, Lenstra JK, Rinnooy Kan AHG (1983) Scheduling subject to resource constraints: classification and complexity. Discrete Appl Math 5:11–24

    Article  MathSciNet  MATH  Google Scholar 

  21. Ventura JA, Kim D (2000) Parallel machine scheduling about an unrestricted due date and additional resource constraints. IIE Trans 32:147–153

    Google Scholar 

  22. Ruiz-Torres AJ, Centeno G (2007) Scheduling with flexible resources in parallel workcenters to minimize maximum completion time. Comput Oper Res 34:48–69

    Article  MathSciNet  MATH  Google Scholar 

  23. Daniels RL, Hoopes BJ, Mazzola JB (1996) Scheduling parallel manufacturing cells with resource flexibility. Manage Sci 42(9):1260–1276

    Article  MATH  Google Scholar 

  24. Daniels RL, Hoopes BJ, Mazzola JB (1997) An analysis of heuristics for the parallel-machine flexible-resource scheduling problem. Ann Oper Res 70:439–472

    Article  MATH  Google Scholar 

  25. Kellerer H, Strusevisch VA (2003) Scheduling parallel dedicated machines under a single non-shared resource. Eur J Oper Res 147:345–364

    Article  MATH  Google Scholar 

  26. Kellerer H, Strusevisch VA (2004) Scheduling problems for parallel dedicated machines under multiple resource constraints. Discrete Appl Math 133:45–68

    Article  Google Scholar 

  27. Li Y, Wang F, Lim A (2003) Resource constraints machine scheduling: A genetic algorithm approach, CEC: 2003 Congress on Evolutionary Computation, 1-4, 1080–1085

  28. Tamaki H, Hasegawa Y, Kozasa J, Araki M (1993) Application of search methods to scheduling problem in plastics forming plant: a binary representation approach. In: Proc. of the 32nd IEEE Conference on Decision and Control, pp 3845–3850

  29. Bourland KE, Carl LK (1994) Parallel machine scheduling with fractional operator requirements. IIE Trans 26(5):56–65

    Article  Google Scholar 

  30. Nagarur N, Vrat P, Duongsuwan W (1997) Production planning and scheduling for injection molding of pipe fittings. Int J Prod Econ 53:157–170

    Article  Google Scholar 

  31. Gao L, Wang C, Wang D, Yin Z, Wang S (1998) A production scheduling system for parallel machines in an electrical appliance plant. Comput Ind Eng 35(1–2):105–108

    Article  Google Scholar 

  32. Nagendra P, Das SK, Nathan S (2000) Deriving the detailed machine schedule from a weekly MRP requirement. Prod Plan Control 11(6):547–555

    Article  Google Scholar 

  33. Lin CKY, Wong CL, Yeung YC (2002) Heuristic approaches for a scheduling problem in the plastic molding department of an audio company. J Heuristics 8:515–540

    Article  Google Scholar 

  34. Chen J-F (2005) Unrelated parallel machine scheduling with secondary resource constraints. Int J Adv Manuf Tech 26:285–292

    Article  Google Scholar 

  35. Chen J-F, Wu T-H (2006) Total tardiness minimization on unrelated parallel machine scheduling with auxiliary equipment constraints. Omega- Int J Manage S 34:81–89

    Article  Google Scholar 

  36. Edis EB, Araz C, Ozkarahan I (2008) Lagrangian-based solution approaches for a resource-constrained parallel machine scheduling problem with machine eligibility restrictions. In: The twenty first international conference on Industrial, Engineering & Other Applications of Applied Intelligent Systems (IEA/AIE 2008), LNAI 5027, pp 337–346

  37. Van den Akker JM, Hurkens CAJ, Savelsbergh MWP (2000) Time-indexed formulations for machine scheduling problems: column generation. INFORMS J Comput 12(2):111–124

    Article  MathSciNet  MATH  Google Scholar 

  38. 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  MathSciNet  MATH  Google Scholar 

  39. Grigoriev A, Sviridenko M, Uetz M (2005) Unrelated parallel machine scheduling with resource dependent processing times. In: Jünger M, Kaibel V (eds) LNCS, 3509. Springer, Berlin, pp 182–195

    Google Scholar 

  40. Jain V, Grossmann IE (2001) Algorithms for hybrid MILP/CP models for a class of optimization problems. INFORMS J Comput 13:258–276

    Article  MathSciNet  Google Scholar 

  41. ILOG OPL Studio 3.7 (2003) Language manual. ILOG S.A., France

    Google Scholar 

  42. ILOG CPLEX 9.0 (2005) User’s manual. ILOG S.A., France

    Google Scholar 

  43. ILOG Solver 6.0 (2005) User’s manual. ILOG S.A., France

    Google Scholar 

  44. ILOG Scheduler 6.0 (2005) User’s manual 2005. ILOG S.A., France

    Google Scholar 

  45. Edis EB, Ozkarahan I (2008) Parallel Machine Scheduling Problem with Additional Resources and Machine Eligibility Restrictions: An Iterative Integer Programming Approach. International Journal of Computers, Information Technology and Engineering, 2(1):1–9

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Dokuz Eylul University, Tınaztepe Kampusu, 35160, Buca, Izmir, Turkey

    Emrah B. Edis

  2. Computer Science Department, Troy University, Montgomery, AL, 36103-4419, USA

    Irem Ozkarahan

Authors
  1. Emrah B. Edis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Irem Ozkarahan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Emrah B. Edis.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Edis, E.B., Ozkarahan, I. Solution approaches for a real-life resource-constrained parallel machine scheduling problem. Int J Adv Manuf Technol 58, 1141–1153 (2012). https://doi.org/10.1007/s00170-011-3454-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-011-3454-8

Keywords

Search

Navigation