Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness. - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Production Economics Année : 2000

Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness.

Résumé

We study the scheduling of N jobs in a V-stage hybrid flow shop with identical parallel machines, when jobs are subject to precedence constraints, several time lags, and due-dates. Precedence constraints concern jobs; they enable the modeling of several uses of the same sequence of machines or di!erent processing units in a flow shop organization. Time lags can be either machine setup time, machine removal time or transportation time. Six new heuristics are presented to solve this problem minimizing maximum lateness. Numerous experiments have been done to assess the performance and robustness of these algorithms. Computational results illustrate the solution quality.
Fichier non déposé

Dates et versions

hal-00398647 , version 1 (21-12-2018)

Identifiants

  • HAL Id : hal-00398647 , version 1

Citer

Valerie Botta-Genoulaz. Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness.. International Journal of Production Economics, 2000, 64 (1-3), pp.101-111. ⟨hal-00398647⟩
145 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More