By Topic

Scheduling no-wait production with time windows and flexible processing times

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
$33 $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

3 Author(s)
F. Chauvet ; Inst. Nat. de Recherche en Inf. et Autom., Metz, France ; J. -M. Proth ; Y. Wardi

This paper presents a low-complexity algorithm for online job scheduling at workcenters along a given route in a manufacturing system. At each workcenter, the job has to be processed by any one of a given set of identical machines. Each machine has a preset schedule of operations, leaving out time-windows during which the job's processing must be scheduled. The manufacturing system has no internal buffers and the job cannot wait between two consecutive operations. There is some flexibility in the job's processing times, which must be confined to given time intervals. The scheduling algorithm minimizes the job's completion time, and it is executable in real time whenever the job requirement is generated

Published in:

IEEE Transactions on Robotics and Automation  (Volume:17 ,  Issue: 1 )