An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search

Annals of Operations Research

Volumn 70, Issue , 1997, Pages 281-306

  Dauzère Pérès, Stéphane ^a   Paulli, Jan ^b  

^a ECOLE DES MINES DE NANTES   (France)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

Analysis of algorithms; Deterministic; Disjunctive graph model; Job shop scheduling; Multiple machine; Multiprocessor; Production scheduling; Sequencing; Suboptimal algorithms: Tabu search

Indexed keywords

EID: 0042261208     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018930406487     Document Type: Article

References (19)

1. J. Adams, E. Balas and D. Zawack, The shifting bottleneck procedure for job-shop scheduling, Management Science 34(1988)391-401.
2. P. Brandimarte, Routing and scheduling in a flexible job shop by tabu search, Annals of Operations Research 41(1993)57-183.
3. P. Brucker and R. Schlie, Job-shop scheduling with multi-purpose machines, Computing 45(1990) 369-375.
4. P. Brucker, B. Jurisch and B. Sievers, A branch and bound algorithm for the job-shop scheduling problem, Discrete Applied Mathematics 49(1994)107-127.
5. S. Dauzère-Pérès, A connected neighborhood structure for the multiprocessor job-shop scheduling problem, Management Report Series No. 180, Rotterdam School of Management, Erasmus Universiteit Rotterdam, The Netherlands, 1994.
6. S. Dauzère-Pérès and J. Paulli, Solving the general multiprocessor job-shop scheduling problem, Management Report Series No. 182, Rotterdam School of Management, Erasmus Universiteit Rotterdam, The Netherlands, 1994.
7. H. Fisher and G.L. Thompson, Probabilistic learning combinations of local job-shop scheduling rules, in: Industrial Scheduling, J.F. Muth and G.L. Thompson, eds., Prentice Hall, Englewood Cliffs, 1963, pp. 225-251.
8. M.R. Garey, D.S. Johnson and R. Sethi, The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research 1(1976)117-129.
9. F. Glover, Tabu Search - Part I, ORSA Journal on Computing 1(1989)190-206.
10. F. Glover, Tabu Search - Part II, ORSA Journal on Computing 2(1990)4-32.
11. F. Glover, E. Taillard and D. de Werra, A user's guide to tabu search, Annals of Operations Research 41(1993)3-28.
12. F. Glover, M. Laguna, E. Taillard and D. de Werra (eds.), Tabu search, Annals of Operations Research 41(1993) (the complete volume).
13. J. Hurink, B. Jurisch and M. Thole, Tabu search for thejob-shop scheduling problem with multipurpose machines, OR Spektrum 15(1994)205-215.
14. E. Nowicki and C. Smutnicki, A fast taboo search algorithm for the job shop problem, Preprint 8/93, Institute of Engineering Cybernetics, Technical University of Wroclaw, 1993.
15. J. Paulli, A hierarchical approach for the FMS scheduling problem, to appear in European Journal of Operational Research, 1995.
16. B. Roy and B. Sussman, Les problèmes d'ordonnancement avec contraintes disjunctives, Note DS No. 9 bis, SEMA, Montrouge, 1964.
17. E. Taillard, Parallel taboo search techniques for the job shop scheduling problem, ORSA Journal on Computing 6(1994)108-117.
18. R.J.M. Vaessens, E.H.L. Aarts and J.K. Lenstra, Job shop scheduling by local search, Memorandum COSOR 94-05, Eindhoven University of Technology, The Netherlands, 1994.
19. P.M. van Laarhoven, E.H.L. Aarts and J.K. Lenstra, Job shop scheduling by simulated annealing, Operations Research 40(1992)113-125.