By Topic

A heuristic algorithm for the computation of cyclic schedules and the necessary WIP to obtain optimal cycle time

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ohl, H. ; CNRS, Ecole Centrale de Lille, France ; Camus, H. ; Castelain, E. ; Gentina, J.C.

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