Exact algorithms for scheduling multiple families of jobs on parallel machines

Naval Research Logistics

Volumn 50, Issue 7, 2003, Pages 823-840

  Chen, Zhi Long ^a   Powell, Warren B ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b Princeton University   (United States)

Author keywords

Branch and bound; Column generation; Parallel machine scheduling; Set partitioning type formulation; Setup times

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; HEURISTIC METHODS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING;

COLUMN GENERATION; PARALLEL MACHINES; SCHEDULING MULTIPLE FAMILIES; SET PARTITIONING;

SCHEDULING;

EID: 0142008777     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/nav.10091     Document Type: Article

References (26)

1. A. Allahverdi, J.N.D. Gupta, and T. Aldowaisan, A review of scheduling research involving setup considerations, OMEGA Internat J Management Sci 27 (1999), 219-239.
2. C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, and P.H. Vance, Branch-and-price: Column generation for solving huge integer programs, Oper Res 46 (1998), 316-329.
3. Z.-L. Chen and W.B. Powell, Solving parallel machine scheduling problems by column generation, INFORMS J Comput 11 (1999), 78-94.
4. Z.-L. Chen and W.B. Powell, A column generation based decomposition approach for a parallel machine just-in-time scheduling problem, European J Oper Res 116 (1999), 220-232.
5. R.W. Conway, W.L. Maxwell, and L.W. Miller, Theory of scheduling, Addison-Wesley, Reading, MA, 1967.
6. G.B. Dantzig and P. Wolfe, Decomposition principle for linear programs, Oper Res 8 (1960), 101-111.
7. M. Desrochers, J. Desrosiers, and M. Solomon, A new optimization algorithm for the vehicle routing problem with time windows, Oper Res 40 (1992), 342-354.
8. B.L. Dietrich and L.F. Escudero, On modelling the maximum workload allocation for parallel unrelated machines with setups, Ann Oper Res 43 (1993), 359-377.
9. J.B. Ghosh, Batch scheduling to minimize total completion time, Oper Res Letters 16 (1994), 271-275.
10. S. Kang, K. Malik, and L.J. Thomas, Lotsizing and scheduling on parallel machines with sequence-dependent setup costs, Management Sci 45 (1999), 273-288.
11. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, "Sequencing and scheduling: Algorithms and complexity," Handbooks in operations research and management science, Volume 4, Logistics of production of inventory, S. Graves, A.H.G. Rinnooy Kan, and P. Zipkin (Editors), North-Holland, Amsterdam, 1993, pp. 445-522.
12. C.-Y. Lee and Z.-L. Chen, Scheduling of jobs and maintenance activities on parallel machines, Naval Res Logist 47 (2000), 145-165.
13. M.M. Liaee and H. Emmons, Scheduling families of jobs with setup times, Int J Prod Econ 51 (1997), 165-176.
14. A. Mehrotra and M.A. Trick, A column generation approach to graph coloring, INFORMS J Comput 8 (1996), 344-354.
15. C.L. Monma and C.N. Potts, On the complexity of scheduling with batch setup times, Oper Res 37 (1989), 798-804.
16. M. Pinedo, Scheduling: Theory, algorithm, and system, Prentice Hall, Englewood Cliffs, NJ, 1995.
17. C.N. Potts and M.Y. Kovalyov, Scheduling with batching: A review, European J Oper Res 120 (2000), 228-249.
18. C.N. Potts and L.N. vn Wassenhove, Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity, J Oper Res Soc 43 (1992), 395-406.
19. M. Savelsbergh, A branch-and-price algorithm for the generalized assignment problem, Oper Res 45 (1997), 831-841.
20. P.H. Vance, C. Barnhart, E.L. Johnson, and G.L. Nemhauser, Solving binary cutting stock problems by column generation and branch-and-bound, Comput Optim Appl 3 (1994), 111-130.
21. J.M. Van den Akker, C.A.J. Hurkens and M.W.P. Savelsbergh, Time-indexed formulations for machine scheduling problems: Column generation, INFORMS J Comput 12 (2000), 111-124.
22. J.M. Van den Akker, J.A. Hoogeveen, and S.L. Van de Velde, Parallel machine scheduling by column generation, Oper Res 47 (1999), 862-872.
23. S. Webster and M. Azizoglu, Dynamic programming algorithms for scheduling parallel machines with family setup times, Comput Oper Res (2001), 127-137.
24. S. Webster and K.R. Baker, Scheduling groups of jobs on a single machine, Oper Res 43 (1995), 692-703.
25. M.X. Weng, J. Lu, and H. Ren, Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective, Int J Prod Econ 70 (2001), 215-226.
26. L.A. Wolsey, Integer programming, Wiley, New York, 1998.