A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
Authors:
- ChaoYong ZhangCZChaoYong Zhang
- PeiGen LiPLPeiGen Li
- ZaiLin GuanZGZaiLin Guan
- YunQing RaoYRYunQing Rao
Top Cited Papers
- 1 November 2007
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 34 (11) , 3229-3242
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Deterministic job-shop scheduling: Past, present and futureEuropean Journal of Operational Research, 1999
- Job Shop Scheduling by Local SearchINFORMS Journal on Computing, 1996
- The job shop scheduling problem: Conventional and new solution techniquesEuropean Journal of Operational Research, 1996
- A Fast Taboo Search Algorithm for the Job Shop ProblemManagement Science, 1996
- A genetic algorithm for the job shop problemComputers & Operations Research, 1995
- Parallel Taboo Search Techniques for the Job Shop Scheduling ProblemINFORMS Journal on Computing, 1994
- A branch and bound algorithm for the job-shop scheduling problemDiscrete Applied Mathematics, 1994
- Job Shop Scheduling by Simulated AnnealingOperations Research, 1992
- An Algorithm for Solving the Job-Shop ProblemManagement Science, 1989
- The Shifting Bottleneck Procedure for Job Shop SchedulingManagement Science, 1988