A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem

Computers and Operations Research

Volumn 38, Issue 6, 2011, Pages 967-983

  Blbl, Kerem ^a  

^a SABANCI UNIVERSITY   (Turkey)

Author keywords

Job shop; Preemption; Shifting bottleneck; Tabu search; Transportation problem; Weighted tardiness

Indexed keywords

BENCHMARKING; HEURISTIC ALGORITHMS; OPTIMIZATION; TABU SEARCH;

JOB SHOP; PREEMPTION; SHIFTING BOTTLENECK; TRANSPORTATION PROBLEM; WEIGHTED TARDINESS;

JOB SHOP SCHEDULING;

EID: 84995332281     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2010.09.015     Document Type: Article

References (26)

1. R. Graham, E. Lawler, J. Lenstra, and A. Rinnooy Kan Optimization and approximation in deterministic sequencing and scheduling: a survey Annals of Discrete Mathematics 5 1979 287 326
2. A. Jain, and S. Meeran Deterministic job-shop scheduling, present and future: past European Journal of Operations Research 113 2 1999 390 434
3. J. Lenstra, A. Rinnooy Kan, and P. Brucker Complexity of machine scheduling problems Annals of Discrete Mathematics 1 1977 343 362
4. M. Singer, and M. Pinedo A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops IIE Transactions 30 2 1998 109 118
5. A.P.J. Vepsalainen Priority rules for job shops with weighted tardiness costs Management Science 33 8 1987 1035 1047
6. M. Pinedo, and M. Singer A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop Naval Research Logistics 46 1 1999 1 17
7. M. Singer Decomposition methods for large job shops Computers & Operations Research 28 3 2001 193 207
8. S. Kreipl A large step random walk for minimizing total weighted tardiness in a job shop Journal of Scheduling 3 3 2000 125 138
9. K. De Bontridder Minimizing total weighted tardiness in a generalized job shop Journal of Scheduling 8 6 2005 479 496
10. I. Essafi, Y. Mati, and S. Dauzere-Peres A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem Computers & Operations Research 35 8 2008 2599 2616
11. Suh C. Controlled search simulated annealing for job shop scheduling. PhD Thesis, University of Texas, Austin; 1988.
12. E. Balas, and A. Vazacopoulos Guided local search with shifting bottleneck for job shop scheduling Management Science 44 2 1998 262 275
13. M. Pinedo Scheduling: theory, algorithms, and systems 3rd ed 2008 Springer
14. K. Bulbul, P. Kaminsky, and C. Yano Preemption in single machine earliness/tardiness scheduling Journal of Scheduling 10 45 2007 271 292
15. J. Adams, E. Balas, and D. Zawack The shifting bottleneck procedure for job shop scheduling Management Science 34 3 1988 391 401
16. Roy B, Sussman B. Les problemes d'ordonnancement avec contraintes disjonctives, Paris: Note DS No. 9 bis. SEMA; 1964.
17. R. Bellman On a routing problem Quarterly of Applied Mathematics 16 1958 87 90
18. H. Aytug, K. Kempf, and R. Uzsoy Measures of subproblem criticality in decomposition algorithms for shop scheduling International Journal of Production Research 41 5 2002 865 882
19. N. Runge, and F. Sourd A new model for the preemptive earliness-tardiness scheduling problem Computers & Operations Research 36 7 2009 2242 2249
20. S. Dauzere-Peres, and J. Lasserre A modified shifting bottleneck procedure for job shop scheduling International Journal of Production Research 31 4 1993 923 932
21. E. Demirkol, S. Mehta, and R. Uzsoy A computational study of shifting bottleneck procedures for shop scheduling problems Journal of Heuristics 3 2 1997 111 137
22. Bulbul K. A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem. Technical Report SU-FENS-2009/0013, Sabanc University, Istanbul, Turkey; 2010. 〈 http://research.sabanciuniv. edu/13951/ 〉.
23. Lawrence S. Supplement to Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. GSIA, Carnegie Mellon University, Pittsburgh, PA; 1984.
24. Tanaka S, Fujikuma S. An efficient exact algorithm for general single-machine scheduling with machine idle time. In: IEEE international conference on automation science and engineering, 2008, CASE 2008, 2008. p. 37176.
25. M. Dyer, and L. Wolsey Formulating the single machine sequencing problem with release dates as a mixed integer program Discrete Applied Mathematics 26 23 1990 255 270
26. J.F. Goncalves, J.J. de Magalhaes Mendes, and M.G. Resende A hybrid genetic algorithm for the job shop scheduling problem European Journal of Operations Research 167 1 2005 77 95