A computational study of lower bounding schemes for total weighted tardiness job shops

2009 2nd International Symposium on Logistics and Industrial Informatics, LINDI 2009

Volumn , Issue , 2009, Pages

  Braune, Roland ^a   Zäpfel, Günther ^a   Affenzeller, Michael ^b  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

^b UNIVERSITY OF APPLIED SCIENCES UPPER AUSTRIA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE OPTIMIZATION; BENCH-MARK PROBLEMS; COMPUTATION TIME; COMPUTATIONAL RESULTS; COMPUTATIONAL STUDIES; JOB SHOP; JOB SHOP SCHEDULING PROBLEMS; LOWER BOUNDS; MAKESPAN; OBJECTIVE FUNCTIONS; OPTIMAL SOLUTIONS; TOTAL-WEIGHTED TARDINESS; UPPER BOUND;

CONTROL THEORY;

SCHEDULING ALGORITHMS;

EID: 70449894087     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LINDI.2009.5258570     Document Type: Conference Paper

References (14)

1. S. French, Sequencing and Scheduling: An Introduction to the Mathematics of the Job Shop. Chichester: Ellis Horwood, 1982.
2. M. Singer and M. Pinedo, "A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops," IIE Transactions, vol. 30, no. 2, pp. 109-118, 1997.
3. M. Drotós, G. Erdos, and T. Kis, "Computing lower and upper bounds for a large-scale industrial job shop scheduling problem," European Journal of Operational Research, vol. 197, pp. 296-306, 2009.
4. A. S. Manne, "On the job shop scheduling problem," Operations Research, vol. 8, pp. 219-223, 1960.
5. E. H. Bowman, "The schedule-sequencing problem," Operations Research, vol. 7, no. 5, pp. 621-624, 1959.
6. C.-H. Pan, "A study of integer programming formulations for scheduling problems," International Journal of Systems Science, vol. 28, no. 1, pp. 33-41, 1997.
7. P. Baptiste, M. Flamini, and F. Sourd, "Lagrangian bounds for just-intime job-shop scheduling," Computers & Operations Research, vol. 35, pp. 906-915, 2008.
8. D. J. Hoitomt, P. B. Luh, and K. R. Pattipati, "A practical approach to job-shop scheduling problems," IEEE Transactions on Robotics and Automation, vol. 9, no. 1, pp. 1-13, 1993.
9. H. Chen, C. c., and J.-M. Proth, "An improvement of the lagrangean relaxation approach for job shop scheduling: a dynamic programming method," IEEE Transaction on Robotics and Automation, vol. 14, no. 5, pp. 786-795, Oct. 1998.
10. C. Lemaréchal, "Lagrangian relaxation," in Computational Combinatorial Optimization, ser. LNCS, M. Jünger and D. Naddef, Eds. Springer-Verlag Berlin Heidelberg, 2001, vol. 2241, pp. 112-156.
11. G. Lancia, F. Rinaldi, and P. Serafini, "A compact optimization approach for job-shop problems," in Proceedings of the 3rd Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), P. Baptiste, G. Kendall, A. Munier-Kordon, and F. Sourd, Eds., 2007, pp. 293-300.
12. M. Pinedo and M. Singer, "A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop," Naval Research Logistics, vol. 46, pp. 1-17, 1999.
13. N. Zribi, I. Kacem, A. El-Kamel, and P. Borne, "Minimisation de la somme des retards dans un jobshop flexible," e-STA, vol. 2, 2005.
14. C. Chu, "A branch-and-bound algorithm to minimize total weighted tardiness with different release dates," Naval Research Logistics, vol. 39, pp. 265-283, 1992.