Tabu search and lower bound for an industrial complex shop scheduling problem
In: ISSN: 0360-8352 ; Computers & Industrial Engineering ; https://hal.science/hal-00675098 ; Computers & Industrial Engineering, 2012, 62 (4), pp.1109-1118. ⟨10.1016/j.cie.2012.01.003⟩, 2012
academicJournal
Zugriff:
International audience ; This paper deals with an industrial shop scheduling problem that arises in a metal goods production group. The scheduling problem can be seen as a multi-mode job shop with assembly. Jobs have additional constraints such as release date, due date and sequence-dependent setup times. The aim of the decision-makers is to minimize the maximum lateness. This article introduces a tabu search procedure to solve the whole problem and a valid lower bound used to evaluate the tabu search procedure.
| Titel: |
Tabu search and lower bound for an industrial complex shop scheduling problem
|
|---|---|
| Autor/in / Beteiligte Person: | Prot, Damien ; Bellenguez-Morineau, Odile ; Systèmes Logistiques et de Production (SLP) ; Institut de Recherche en Communications et en Cybernétique de Nantes (IRCCyN) ; Mines Nantes (Mines Nantes)-École Centrale de Nantes (ECN)-Ecole Polytechnique de l'Université de Nantes (EPUN) ; Université de Nantes (UN)-Université de Nantes (UN)-PRES Université Nantes Angers Le Mans (UNAM)-Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-École Centrale de Nantes (ECN)-Ecole Polytechnique de l'Université de Nantes (EPUN) ; Université de Nantes (UN)-Université de Nantes (UN)-PRES Université Nantes Angers Le Mans (UNAM)-Centre National de la Recherche Scientifique (CNRS) |
| Link: | |
| Zeitschrift: | ISSN: 0360-8352 ; Computers & Industrial Engineering ; https://hal.science/hal-00675098 ; Computers & Industrial Engineering, 2012, 62 (4), pp.1109-1118. ⟨10.1016/j.cie.2012.01.003⟩, 2012 |
| Veröffentlichung: | HAL CCSD ; Elsevier, 2012 |
| Medientyp: | academicJournal |
| DOI: | 10.1016/j.cie.2012.01.003 |
| Schlagwort: |
|
| Sonstiges: |
|