An exension of the heap of pieces model for the Cyclic Jobshop Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

An exension of the heap of pieces model for the Cyclic Jobshop Problem

Résumé

This paper considers Cyclic Jobshop Problem, which aim to find the tasks processing order for each machine that maximizes the throughput or equivalently minimizes the cycle time. We develop a branch and bound enumeration procedure to solve the Cyclic Jobshop Problem, based on heap of pieces theory and max, + algebra. We propose an extension of this model to consider more structures of K−cyclic schedules. It provides more realistic values for the evaluation of the cycle time and improve the efficiency of the approach.
Fichier principal
Vignette du fichier
Houssin_CASE2015.pdf (168.98 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01230183 , version 1 (17-11-2015)

Identifiants

Citer

Laurent Houssin. An exension of the heap of pieces model for the Cyclic Jobshop Problem. IEEE International Conference on Automation Science and Engineering (IEEE CASE 2015), Aug 2015, Goteborg, Sweden. 6p., ⟨10.1109/CoASE.2015.7294258⟩. ⟨hal-01230183⟩
69 Consultations
111 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More