On-line Scheduling with WIP regulation

Abstract : The system under consideration is composed with several machines, and some of these machines may be identical or able to perform the same operations. The manufacturing system is fully automated, and semi-finished products or components are not stored during the process. A limited flexibility exists since the manufacturing times can be extended within certain limits at the expense of the unavailability of the resource in charge of the operation. There are no conflicts between the resources; in other words, the same machine is not used to perform different operations required to complete the same product. Due to the intensity of the flow of products to be manufactured, it is impossible to reschedule the products which have been previously scheduled. Thus, when a new product requirement arrives in the system, we have to take advantage of the idle time windows. The goal is to complete the product as soon as possible. We give a real-time scheduling algorithm which guarantees an optimal makespan to any product which arrives in the system. Some numerical examples are provided to illustrate this approach. In particular, this approach is applied to the regulation of the WIP in an assembly system.
Type de document :
[Research Report] RR-3432, INRIA. 1998, pp.19
Liste complète des métadonnées

Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 12:21:43
Dernière modification le : samedi 17 septembre 2016 - 01:06:47
Document(s) archivé(s) le : jeudi 24 mars 2011 - 12:35:27



  • HAL Id : inria-00073258, version 1



Fabrice Chauvet, Jean-Marie Proth, Yorai Wardi. On-line Scheduling with WIP regulation. [Research Report] RR-3432, INRIA. 1998, pp.19. 〈inria-00073258〉



Consultations de la notice


Téléchargements de fichiers