Citation
Exact algorithms for single-machine scheduling with time windows and precedence constraints. Journal of Scheduling, 19 (3): 309-334, 2016.
Selected
Abstract
We study a single-machine scheduling problem that is a generalization of a number of problems for which computational procedures have already been published. Each job has a processing time, a release date, a due date, a deadline, and a weight representing the penalty per unit-time delay beyond the due date. The goal is to schedule all jobs such that the total weighted tardiness penalty is minimized and both the precedence constraints as well as the time windows (implied by the release dates and the deadlines) are respected. We develop a branch-and-bound algorithm that solves the problem to optimality. Computational results show that our approach is effective in solving medium-sized instances, and that it compares favorably with existing methods for special cases of the problem.
There is no pdf available for this paper. You might like to try to obtain the original source (see the doi, for example)
doi
The doi for this publication is 10.1007/s10951-015-0428-y You can link directly to the original paper, via the doi, from here
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@ARTICLE{2016-309-334-SI, author = {Davari, Morteza and Demeulemeester, Erik and Leus, Roel and Nobibon, Fabrice Talla},
title = {{Exact algorithms for single-machine scheduling with time windows and precedence constraints}},
journal = {Journal of Scheduling},
year = {2016},
volume = {{19}},
pages = {309--334},
number = {3},
note = {Selected},
abstract = {{We study a single-machine scheduling problem that is a generalization of a number of problems for which computational procedures have already been published. Each job has a processing time, a release date, a due date, a deadline, and a weight representing the penalty per unit-time delay beyond the due date. The goal is to schedule all jobs such that the total weighted tardiness penalty is minimized and both the precedence constraints as well as the time windows (implied by the release dates and the deadlines) are respected. We develop a branch-and-bound algorithm that solves the problem to optimality. Computational results show that our approach is effective in solving medium-sized instances, and that it compares favorably with existing methods for special cases of the problem.}},
doi = {{10.1007/s10951-015-0428-y}},
eissn = {{1099-1425}},
issn = {{1094-6136}},
owner = {Graham},
researcherid-numbers = {{Leus, Roel/G-1112-2010}},
timestamp = {2017.01.18},
unique-id = {{ISI:000377606100009}} }