Referenced Items are not available for this document.
In the paper the flexible open - job shop scheduling problem FOJSP (an extension of the classical job shop scheduling) is analyzed. For the optimization of the production process to make span the GRASP and Simulated Annealing algorithms have been used. Different “open” rates have been considered and compared. The presented algorithms have been implemented, tested, and illustrated with examples for serial and parallel routes.
Published in:
Artificial Intelligence and Computational Intelligence (AICI), 2010 International Conference on
(Volume:2
)
Date of Conference: 23-24 Oct. 2010
- Page(s):
- 437 - 442
- Print ISBN:
- 978-1-4244-8432-4
- INSPEC Accession Number:
- 11690043
- Conference Location :
- Sanya
- Digital Object Identifier :
- 10.1109/AICI.2010.212
- Product Type:
- Conference Publications
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.
