Local Search Genetic Algorithms for the Job Shop Scheduling Problem
Authors:
- Beatrice M. OmbukiBOBeatrice M. Ombuki
- Mario VentrescaMVMario Ventresca
- 1 July 2004
- journal article
- research article
- Published by Springer Nature in Applied Intelligence
- Vol. 21 (1) , 99-109
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A Grasp for Job Shop Scheduling2002
- Deterministic job-shop scheduling: Past, present and futureEuropean Journal of Operational Research, 1999
- Job Shop Scheduling by Local SearchINFORMS Journal on Computing, 1996
- Combining the Large-Step Optimization with Tabu-Search: Application to The Job-Shop Scheduling Problem1996
- On permutation representations for scheduling problems1996
- Job-shop scheduling: Computational study of local search and large-step optimization methodsEuropean Journal of Operational Research, 1995
- Parallel Taboo Search Techniques for the Job Shop Scheduling ProblemINFORMS Journal on Computing, 1994
- A Computational Study of the Job-Shop Scheduling ProblemINFORMS Journal on Computing, 1991
- A practical use of Jackson's preemptive schedule for solving the job shop problemAnnals of Operations Research, 1990
- Tabu Search—Part IIINFORMS Journal on Computing, 1990