A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Optimization Année : 2013

A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times

Résumé

We consider the problem of scheduling independent jobs on a single resource under a special unavailability constraint: a set of forbidden instants is given, where no job is allowed to start or complete. We show that a schedule without idle time always exists if the number of forbidden instants is less than the number of distinct processing times appearing in the instance. We derive quite a fast algorithm to find such a schedule, based on an hybridization between a list algorithm and local exchange. As a corollary minimizing the makespan for a fixed number of forbidden instants is polynomial
Fichier principal
Vignette du fichier
article-DOv6.pdf (140.68 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00879144 , version 1 (01-11-2013)

Identifiants

Citer

Christophe Rapine, Nadia Brauner. A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times. Discrete Optimization, 2013, 10, pp.241-250. ⟨10.1016/j.disopt.2013.07.003⟩. ⟨hal-00879144⟩
296 Consultations
182 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More