A tabu search method guided by shifting bottleneck for the job shop scheduling problem
Authors:
- Ferdinando PezzellaFPFerdinando Pezzella
- Emanuela MerelliEMEmanuela Merelli
- 1 January 2000
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 120 (2) , 297-310
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Applying tabu search to the job-shop scheduling problemAnnals of Operations Research, 1993
- A Computational Study of the Job-Shop Scheduling ProblemINFORMS Journal on Computing, 1991
- Tabu Search—Part IIINFORMS Journal on Computing, 1990
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- An Algorithm for Solving the Job-Shop ProblemManagement Science, 1989
- The Shifting Bottleneck Procedure for Job Shop SchedulingManagement Science, 1988
- Future paths for integer programming and links to artificial intelligenceComputers & Operations Research, 1986
- The one-machine sequencing problemEuropean Journal of Operational Research, 1982
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration AlgorithmOperations Research, 1969