Lower bounds and simulated annealing for job shop scheduling problems with blocking constrains

Ali Gorine Nathalie Sauer 1
1 COSTEAM - Optimal and secure management of manufacturing systems
Inria Nancy - Grand Est, UPVM - Université Paul Verlaine - Metz
Abstract : In this paper, we consider the job shop scheduling problem with a particular blocking constraint. The objective is the minimization of the makespan. In this model, a conflict is due to the non-compliance of the precedence and blocking constraints. A necessary and sufficient condition to obtain this conflict is presented. A lower bound to solve this problem is given and a metaheuristic method based on simulated annealing is presented to obtain a solution. Its performances are compared with the optimal solutions.
Type de document :
Communication dans un congrès
IEEE Conference on Emerging Technologies and Factory Automation - ETFA'2010, Sep 2010, Bilbao, Spain. IEEE, pp.1-8, 2010, 〈10.1109/ETFA.2010.5641271〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00601373
Contributeur : Ist Inria Nancy Grand Est <>
Soumis le : vendredi 17 juin 2011 - 14:48:01
Dernière modification le : jeudi 16 mars 2017 - 01:06:18

Identifiants

Collections

Citation

Ali Gorine, Nathalie Sauer. Lower bounds and simulated annealing for job shop scheduling problems with blocking constrains. IEEE Conference on Emerging Technologies and Factory Automation - ETFA'2010, Sep 2010, Bilbao, Spain. IEEE, pp.1-8, 2010, 〈10.1109/ETFA.2010.5641271〉. 〈inria-00601373〉

Partager

Métriques

Consultations de la notice

65