Referenced Items are not available for this document.
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.<
Published in:
IEEE Expert
(Volume:8
,
Issue:
5
)
Date of Publication: Oct. 1993
- Page(s):
- 15 - 24
- ISSN :
- 0885-9000
- INSPEC Accession Number:
- 4562661
- Digital Object Identifier :
- 10.1109/64.236477
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Oct. 1993
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
