This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Managing Genetic Search in Job Shop Scheduling
October 1993 (vol. 8 no. 5)
pp. 15-24

The Vanderbilt Schedule Optimizer Prototype (VSOP), which uses genetic algorithms as search methods for job shop scheduling problems, is discussed. A job shop is a facility that produces goods according to prespecified process plans, under several domain-dependent and common sense constraints. The scheduling of orders in a job shop is a multifaceted problem. VSOP uses domain-specific chromosome representations, recombination operators, and local enumerative search to increase efficiency. Experimental results from a fully implemented VSOP package are presented.

Citation:
Serdar Uckun, Sugato Bagchi, Kazuhiko Kawamura, Yutaka Miyabe, "Managing Genetic Search in Job Shop Scheduling," IEEE Intelligent Systems, vol. 8, no. 5, pp. 15-24, Oct. 1993, doi:10.1109/64.236477
Usage of this product signifies your acceptance of the Terms of Use.