Hybrid job shop scheduling with mixed blocking constraints between operations

Christophe Sauvey () and Wajdi Trabelsi ()
Additional contact information
Wajdi Trabelsi: ICN Business School, LGIPM - Laboratoire de Génie Informatique, de Production et de Maintenance - UL - Université de Lorraine

Post-Print from HAL

Abstract: This paper addresses a hybrid job shop problem with identical machines, where several blocking constraints can be taken into account in a same problem. A mathematical linear integer model is proposed to be able to solve optimally the problem with commercial software. Since this problem is NPhard, we developed an evaluation function in order to be able to solve bigger problems with classical meta-heuristics, thanks to a blocking matrix, containing the blocking constraints encountered after each operation of each job. The benchmark problems are proposed at the end of this paper, and the obtained results validate as much the proposed method as the evaluation function quality and suitability.

Keywords: mixed blocking constraints; mathematic model; meta-heuristics; genetic algorithm; hybrid job-shop; scheduling (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Published in International Conference on Emerging Technologies and Factory Automation (IEEE EFTA), 2015, ⟨10.1109/ETFA.2015.7301538⟩

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:hal-01507983

DOI: 10.1109/ETFA.2015.7301538

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().