Referenced Items are not available for this document.
For the past two decades simulated annealing has been playing a crucial role in the design of optimization strategies for flow shop scheduling applications. This paper presents an efficient simulated annealing algorithm for minimizing the total flow time in permutation flow shop scheduling problems. Empirical results demonstrate the improvement in solution quality obtained by the proposed approach over state-of-the-art methods in the literature.
Published in:
Evolutionary Computation, 2009. CEC '09. IEEE Congress on
Date of Conference: 18-21 May 2009
- Page(s):
- 158 - 165
- E-ISBN :
- 978-1-4244-2959-2
- Print ISBN:
- 978-1-4244-2958-5
- INSPEC Accession Number:
- 10688526
- Conference Location :
- Trondheim
- Digital Object Identifier :
- 10.1109/CEC.2009.4982943
- 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.
