Modelling and solving a practical flexible job-shop scheduling problem with blocking constraints

Yazid Mati Chams Lahlou 1 Stéphane Dauzère-Pérès 2
1 IRCCyN - Institut de Recherche en Communications et en Cybernétique de Nantes
2 SFL-ENSMSE - Département Sciences de la Fabrication et Logistique
Abstract : This paper presents a study of a practical job-shop scheduling problem modelled and solved when helping a company to design a new production workshop. The main characteristics of the problem are that some resources are flexible, and blocking constraints have to be taken into account. The problem and the motivation for solving it are detailed. The modelling of the problem and the proposed resolution approach, a genetic algorithm, are described. Numerical experiments using real data are presented and analysed. We also show how these results were used to support choices in the design of the workshop.
Keywords : Job-shop scheduling genetic algorithm flexible blocking design
Document type :
Journal articles
Complete list of metadatas
https://hal-emse.ccsd.cnrs.fr/emse-00519237
Contributor : Stéphane Dauzère-Pérès <>
Submitted on : Sunday, September 19, 2010 - 12:08:59 PM
Last modification on : Thursday, October 17, 2019 - 12:36:32 PM

Links full text

openaccess

Identifiers

Collections

CNRS | EC-NANTES | SFL-ENSMSE | CMP-ENSMSE | EMSE | IRCCYN | UNIV-NANTES | INSTITUT-TELECOM | UNAM | AUTO | IMT-ATLANTIQUE

Citation

Yazid Mati, Chams Lahlou, Stéphane Dauzère-Pérès. Modelling and solving a practical flexible job-shop scheduling problem with blocking constraints. International Journal of Production Research, Taylor & Francis, 2011, 49 (8), pp.2169-2182. ⟨10.1080/00207541003733775⟩. ⟨emse-00519237⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

415

Contact

Informations

CCSD