Referenced Items are not available for this document.
Presents a heuristic algorithm to determine a cyclic schedule with optimal cycle time while minimizing the work in process (WIP). The respect of the optimal cycle time is a hard constraint during the computation of the schedule, while the minimization of the WIP is considered as an objective. The algorithm builds the schedule progressively and its complexity allows the use under real-time constraints
Published in:
Computer Integrated Manufacturing and Automation Technology, 1994., Proceedings of the Fourth International Conference on
Date of Conference: 10-12 Oct 1994
- Page(s):
- 339 - 344
- Meeting Date :
- 10 Oct 1994-12 Oct 1994
- Print ISBN:
- 0-8186-6510-6
- INSPEC Accession Number:
- 4891542
- Conference Location :
- Troy, NY
- Digital Object Identifier :
- 10.1109/CIMAT.1994.389051
- 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.
