DocumentCode
2571522
Title
A heuristic algorithm for the computation of cyclic schedules and the necessary WIP to obtain optimal cycle time
Author
Ohl, Harald ; Camus, Hervé ; Castelain, Emmanuel ; Gentina, Jean-Claude
Author_Institution
CNRS, Ecole Centrale de Lille, France
fYear
1994
fDate
10-12 Oct 1994
Firstpage
339
Lastpage
344
Abstract
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
Keywords
Petri nets; flexible manufacturing systems; minimisation; production control; cyclic schedules; hard constraint; heuristic algorithm; minimization; optimal cycle time; real-time constraints; work in process; Electric breakdown; Explosions; Flexible manufacturing systems; Heuristic algorithms; Job shop scheduling; Manufacturing systems; Petri nets; Processor scheduling; Production; Scheduling algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Integrated Manufacturing and Automation Technology, 1994., Proceedings of the Fourth International Conference on
Conference_Location
Troy, NY
Print_ISBN
0-8186-6510-6
Type
conf
DOI
10.1109/CIMAT.1994.389051
Filename
389051
Link To Document