A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Applied Mathematics and Computation Année : 2015

A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization

Résumé

We consider the single machine scheduling problem with release dates and tails, provided that the machine is unavailable during a fixed interval. We aim to minimize the maximum delivery time under the nonresumable senario. This problem is strongly NP- hard. The proposed algorithm is based on a branch- and- bound method. We use Jackson's preemptive algorithm with precedence constraints to compute the lower bound and Schrage's sequence as an upper bound. Numerical experiments show that the algorithm can solve large- size instances with up to 1000 jobs. (C) 2014 Elsevier Inc. All rights reserved.
Fichier non déposé

Dates et versions

hal-01277555 , version 1 (22-02-2016)

Identifiants

Citer

Walid Hfaiedh, Cherif Sadfi, Imed Kacem, Atidel Hadj-Alouane. A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization. Applied Mathematics and Computation, 2015, 252, pp.496-502. ⟨10.1016/j.amc.2014.11.103⟩. ⟨hal-01277555⟩
71 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More