Scheduling splittable tasks on a multi-purpose parallel machine problem with release dates and deadlines - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Scheduling splittable tasks on a multi-purpose parallel machine problem with release dates and deadlines

Résumé

In industrial production, a changeover or a setup is a very complex operation to consider and the probability that something breaks on the production line immediately after a changeover is raised significantly. A number of studies about scheduling problems that take into consideration setup times have been presented recently. The problem presented in this paper consist in minimizing the number of setup considering that the jobs scheduled on several machines can be splitted. Firstly, we use a heuristic to find an initial feasible solution and then we apply a neighbourhood search to improve the initial solution. Solutions are represented as sets of assignments and sequences, execution times are then determined using a maximum flow algorithm.
Fichier non déposé

Dates et versions

hal-01025678 , version 1 (18-07-2014)

Identifiants

  • HAL Id : hal-01025678 , version 1

Citer

Jing Qian, Cédric Pessan, Nguyen Huynh Tuong, Emmanuel Neron. Scheduling splittable tasks on a multi-purpose parallel machine problem with release dates and deadlines. International Conference on Computers & Industrial Engineering, Jul 2009, Troyes, France. pp.7-11. ⟨hal-01025678⟩
23 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More