Tabu search and lower bound for an industrial complex shop scheduling problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Computers & Industrial Engineering Année : 2012

Tabu search and lower bound for an industrial complex shop scheduling problem

Résumé

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.

Dates et versions

hal-00675098 , version 1 (29-02-2012)

Identifiants

Citer

Damien Prot, Odile Bellenguez-Morineau. Tabu search and lower bound for an industrial complex shop scheduling problem. Computers & Industrial Engineering, 2012, 62 (4), pp.1109-1118. ⟨10.1016/j.cie.2012.01.003⟩. ⟨hal-00675098⟩
73 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More