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

Walid Hfaiedh, Chérif Sadfi, Imed Kacem and Atidel Hadj-Alouane

Applied Mathematics and Computation, 2015, vol. 252, issue C, 496-502

Abstract: 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.

Keywords: Scheduling; Single machine; Maximum delivery time; Non-availability constraint (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300314016361
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:252:y:2015:i:c:p:496-502

DOI: 10.1016/j.amc.2014.11.103

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().