An integrated column generation and Lagrangian relaxation for flowshop scheduling problems

Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

Volumn , Issue , 2009, Pages 299-304

  Nishi, Tatsushi ^a   Isoya, Yukinori ^a   Inuiguchi, Masahiro ^a  

^a OSAKA UNIVERSITY   (Japan)

Author keywords

Column generation; Flowshop; Lagrangian relaxation; Scheduling

Indexed keywords

BASE COLUMNS; COLUMN GENERATION; COMPUTATIONAL RESULTS; CONVENTIONAL COLUMNS; DUAL SOLUTIONS; FLOW SHOP SCHEDULING PROBLEM; FLOW-SHOPS; LAGRANGIAN RELAXATION; LAGRANGIAN RELAXATION METHOD; SPEED-UPS; TOTAL-WEIGHTED TARDINESS;

CYBERNETICS; SCHEDULING;

LAGRANGE MULTIPLIERS;

EID: 74849096536     PISSN: 1062922X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSMC.2009.5346159     Document Type: Conference Paper

References (14)

1. M. Nawaz, E.E. Enscore and I. Ham, "A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem," OMEGA, vol. 11, pp. 91-95, 1983.
2. C. Chung, J. Flynn, K. Ömer, "A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems," European Journal of Operational Research, vol. 174, no. 1, pp. 1-10, 2006.
3. O. Moursli, Y. Pochet, "A Branch-and-bound algorithm for the hybrid flowshop," International Journal of Production Economics, vol. 64, pp. 113-125, 2000.
4. V. Armentano, D. Ronconi, "Tabu search for total tardiness minimization in flowshop scheduling problems," Computers and Operations Research, vol. 26, no. 3, pp. 219-235, 1999.
5. R. Riuz and T. Stützle, "An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives," European Journal of Operational Research, vol. 187, no. 3, pp. 1143-1159, 2008.
6. D. Huisman, "A column generation approach to the rail crew re-scheduling problem," European Journal of Operational Research, vol. 180, no. 1, pp. 163-173, 2007
7. E. Choi, D.W. Tcha, "A column generation approach to the heterogeneous fleet vehicle routing problem," Computers and Operations Research, vol. 34, no. 7, pp. 2080-2095, 2007.
8. M. Lamiri, V. Augusto and X. Xie, "Patients scheduling in a hospital operating theatre," Proceedings of the 4th IEEE Conference on Automation Science and Engineering, pp. 627-632, 2008.
9. M.E. Lübbecke and J. Destosiers, "Selected topics in column generation," Operations Research, vol. 53, no. 6, pp. 1007-1023, 2005.
10. J.M. van den Akker, J.A. Hoogeveen and S.L. van de Velde, "Combining column generation and Lagrangian relaxation to solve a single-machine common due date problem," INFORMS Journal on Computing, vol. 14, no. 1, pp. 37-51, 2002.
11. D. Huisman, R. Jans, M. Peeters and A.P.M. Wagelmans, "Combining column generation and Lagrangian relaxation," ERIM Report Series, Reference No. ERS-2003-092-LIS, 2003.
12. G.L. Nemhauser and L.A. Wolsey, "Integer and combinatorial optimization," Wiley-Interscience, pp. 323-336, 1988.
13. T. Nishi, Y. Hiranaka and M. Inuiguchi, "Successive Lagrangian approach for flowshop scheduling problems to minimize the total weighted tardiness," Proceedings of the 3rd Annual Conference on Automation Science and Engineering, pp. 658-663, 2007.
14. E. Taillard, "Benchmarks for basic scheduling problems," European Journal of Operational Research, vol. 64, no. 2, pp. 278-285, 1993.