Multiresource Shop Scheduling With Resource Flexibility and Blocking

Abstract : This paper proposes a general scheduling model that extends job-shop scheduling models to incorporate important features of real manufacturing systems. More precisely, each operation can be performed in different modes and requires a different set of resources depending on the mode. Further, we consider blocking constraints that requires to hold resources used for an operation till resources needed for the next operation of the same job are available. A shortest path approach extending the classical geometric approach is proposed for the two-job case. A greedy heuristic is then proposed to schedule $N$ jobs by considering jobs sequentially, grouping scheduled jobs into a combined job and then scheduling it and the next unscheduled job using the shortest path approach. A metaheuristic is then used to identify effective job sequences. Extensive numerical experimentation proves the efficiency of our approach.
Type de document :
Article dans une revue
IEEE Transactions on Automation Science and Engineering, Institute of Electrical and Electronics Engineers, 2011, 8 (1), pp.175. 〈10.1109/TASE.2010.2052356〉
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-00558607
Contributeur : Andrée-Aimée Toucas <>
Soumis le : samedi 22 janvier 2011 - 16:09:01
Dernière modification le : mercredi 29 novembre 2017 - 10:07:11

Identifiants

Citation

Yazid Mati, Xie Xiaolan. Multiresource Shop Scheduling With Resource Flexibility and Blocking. IEEE Transactions on Automation Science and Engineering, Institute of Electrical and Electronics Engineers, 2011, 8 (1), pp.175. 〈10.1109/TASE.2010.2052356〉. 〈emse-00558607〉

Partager

Métriques

Consultations de la notice

47