Column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem

European Journal of Operational Research

Volumn 116, Issue 1, 1999, Pages 220-232

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

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; INTEGER PROGRAMMING; JUST IN TIME PRODUCTION; MACHINERY; SCHEDULING; SET THEORY;

BRANCH AND BOUND; COLUMN GENERATION; DANTZIG-WOLFE DECOMPOSITION; JUST IN TIME SCHEDULING PROBLEM; PARALLEL MACHINE SCHEDULING; SET PARTITIONING;

OPTIMIZATION;

EID: 0032641373     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00136-2     Document Type: Article

References (26)

1. K.R. Baker, G.D. Scudder, Sequencing with earliness and tardiness penalties: A review, Operations Research 38 (1990).
2. C. Barnhart, E. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, P.H. Vance, Branch-and-price: Column generation for solving huge integer programs, in: J.R. Birge, K.G. Murty (Eds.), Mathematical Programming: State of the Art 1994, The University of Michigan, 1994, pp. 186-207.
3. D. Cattrysse, M. Salomon, R. Kuik, L.N. van Wassenhove, A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup times, Management Science 39 (4) (1993) 477-486.
4. L.M.A. Chan, P. Kaminsky, A. Muriel, D. Simchi-Levi, Machine scheduling, linear programming and list scheduling heuristic, Technical report, Northwestern University, Chicago, 1995.
5. Z.-L. Chen, W.B. Powell, Solving parallel machine scheduling problems by column generation, Technical report, to appear in INFORMS Journal of Computing.
6. T.C.E. Cheng, A heuristic for common due-date assignment and job scheduling on parallel machines, Journal of Operational Research Society 40 (1989) 1129-1135.
7. T.C.E. Cheng, Z.-L. Chen, Parallel-machine scheduling problems with earliness and tardiness penalties, Journal of Operational Research Society 45 (1994) 685-695.
8. G.B. Dantzig, P. Wolfe, Decomposition principle for linear programs, Operations Research 8 (1960) 101-111.
9. J.S. Davis, J.J. Kanet, Single-machine scheduling with early and tardy completion costs, Naval Research Logistics 40 (1993) 85-101.
10. P. De, J.B. Ghosh, C.E. Wells, Due-date assignment and early/tardy scheduling on identical parallel machines, Naval Research Logistics 41 (1994) 17-32.
11. M. Desrochers, J. Desrosiers, M. Solomon, A new optimization algorithm for the vehicle routing problem with time windows, Operations Research 40 (1992) 342-354.
12. H. Emmons, Scheduling to a common due date on parallel uniform processors, Naval Research Logistics 34 (1987) 803-810.
13. A. Federgruen, G. Mosheiov, Simultaneous optimization of efficiency and performance balance measures in single-machine scheduling problems, Naval Research Logistics 40 (1993) 951-970.
14. N.G. Hall, M.E. Posner, Earliness-tardiness scheduling problems, I: Weighted deviation of completion times about a common due date, Operations Research 39 (1991) 836-846.
15. Y.-D. Kim, C.A. Yano, Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates, Naval Research Logistics 41 (1994) 913-933.
16. L.S. Lasdon, Optimization Theory for Large Systems, MacMillan, New York, 1970.
17. S. Lavoie, M. Minoux, E. Odier, A new approach for crew pairing problems by column generation with an application to air transport, European Journal of Operational Research 35 (1988) 45-58.
18. C.-L. Li, Z.-L. Chen, T.C.E. Cheng, A note on one-processor scheduling with asymmetric earliness and tardiness penalties, Operations Research Letters 13 (1993) 45-48.
19. C.-L. Li, T.C.E. Cheng, Z.-L. Chen, Single-machine scheduling to minimize the weighted number of early and tardy aggreeable jobs, Computers and Operations Research 22 (1995) 205-219.
20. S.D. Liman, C.Y. Lee, Error bound of a heuristic for the common due date scheduling problem, ORSA Journal on Computing 5 (1993) 420-425.
21. M. Laguna, J.L.G. Velarde, A search heuristic for just-in-time scheduling in parallel machines, Journal of Intelligent Manufacturing 2 (1991) 253-260.
22. A. Mehrotra, M.A. Trick, A column generation approach to graph coloring, Technical report, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA, 1993.
23. G. Nemhauser, L. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.
24. J.M. van den Akker, J.A. Hoogeveen, S.L. van de Velde, Parallel machine scheduling by column generation, Technical report, Center for Operations Research and Econometrics, Université Catholique de Louvain, Belgium, 1995.
25. P.H. Vance, Crew scheduling, cutting stock, and column generation: Solving huge integer programs, Technical report, Ph.D. dissertation, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia, 1993.
26. P.H. Vance, C. Barnhart, E.L. Johnson, G.L. Nemhauser, Solving binary cutting stock problems by column generation and branch-and-bound, Computational Optimization and Applications 3 (1994) 111-130.