Minimizing total weighted tardiness in a generalized job shop

Journal of Scheduling

Volumn 8, Issue 6, 2005, Pages 479-496

  De Bontridder, K M J ^a  

^a Siemens VDO Automotive   (Netherlands)

Author keywords

Job shop scheduling; Tabu search; Total weighted tardiness

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; INFORMATION THEORY; OPERATIONS RESEARCH;

COST FLOW; JOB SHOP SCHEDULING; TABU SEARCH; TOTAL WEIGHTED TARDINESS;

SCHEDULING;

EID: 26644446942     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-005-4779-7     Document Type: Article

References (26)

1. Aarts, B. J. M., "A parallel local search algorithm for the job shop scheduling problem," Master's thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, 1996.
2. Aarts, E. H. L. and J. K. Lenstra (eds.), Local Search in Combinatorial Optimization, Wiley, Chichester, 1997.
3. Adams, J., E. Balas and D. Zawack, "The shifting bottleneck procedure for job shop scheduling", Management Science 34, 391-401 (1988).
4. Ahuja, R. K., T. L. Magnanti and J. B. Orlin, Network Flows - Theory, Algorithms, and Applications, Prentice Hall, Englewood Cliffs, New Jersey, 1993.
5. Applegate, D. and W. Cook, "A computational study of the job shop scheduling problem", ORSA Journal on Computing 3, 149-156 (1991).
6. Balas, E., "Machine sequencing via disjunctive graphs: an implicit enumeration algorithm", Operations Research 17, 941-957 (1969).
7. De Bontridder, K. M. J., "Integrating purchase and production planning: using local search in supply chain optimization," Ph.D. thesis, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, 2001.
8. Faaland, B. and T. Schmitt, "Scheduling tasks with due dates in a fabrication/assembly process", Operations Research 35, 378-388 (1987).
9. Fisher, H. and G. L. Thompson, "Probabilistic learning combinations of local job-shop scheduling rules", In J. F. Muth and G. L. Thompson (eds.), Industrial Scheduling, Prentice Hall, Englewood Cliffs, New Jersey, 1963, pp. 225-251.
10. Glover, F., "Tabu search: part 1", ORSA Journal on Computing 1, 190-206 (1989).
11. Glover, F., "Tabu search: part 2", ORSA Journal on Computing 2, 4-32 (1990).
12. Kreipl, S., "A large step random walk for minimizing total weighted tardiness in a job shop", Journal of Scheduling 3, 125-138 (2000).
13. Lawrence, S., "Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement)," Technical report, Graduate School of Industrial Engineering, Carnegie Mellon University, Pittsburgh, Pennsylvania, 1984.
14. Nowicki, E. and C. Smutnicki, "A fast taboo search algorithm for the job shop problem", Management Science 42, 797-913 (1996).
15. Pinedo, M., Scheduling: Theory, Algorithms, and Systems, Prentice Hall, Englewood Cliffs, New Jersey, 1995.
16. Pinedo, M. and M. Singer, "A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop", Naval Research Logistics 46, 1-19 (1999).
17. Roy, B. and B. Sussmann, Les problèmes d'ordonnancement avec contraintes disjunctives, Note DS No. 9 bis, SEMA, Montrouge, 1964.
18. Singer, M. and M. Pinedo, "A computational study of branch and bound techniques for minimizing the total weighted tardiness in flow shops and job shops", IIE Transactions 30, 109-119 (1998).
19. Smith, W. E., "Various optimizers for single stage production", Naval Research Logistics Quarterly 3, 59-66 (1956).
20. Standard Performance Evaluation Corporation, "Performance results specint95", www.spec.org/cgibin/osgresults?conf=cint95, 1999.
21. Vaessens, R. J. M., Generalized Job Shop Scheduling: Complexity and Local Search, Ph.D. thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, 1995.
22. Vaessens, R. J. M., E. H. L. Aarts, and J. K. Lenstra, "Job shop scheduling by local search", INFORMS Journal on Computing 8, 302-317 (1996).
23. Verhoeven, M. G. A. "Tabu search for resource-constrained scheduling", European Journal of Operational Research 106, 266-276 (1998).
24. Wennink, M., "Algorithm support for automated planning boards," Ph.D. thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, 1995.
25. Wennink, M., "Finding selection-optimal schedules by means of maximum cost flows", Operations Research Letters, 2000, to appear.
26. Wennink, M. and R. Vaessens, "An efficient insertion algorithm with multiprocessor operations", Working paper, Department of Mathematics and Computing Science, Eindhoven University of Technology, 1995.