Citation
The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times. Annals of Operations Research, 159 (1): 25-40, 2008.
Selected
Abstract
We study the earliness-tardiness scheduling problem on a single machine with due date assignment and controllable processing times. We analyze the problem with three different due date assignment methods and two different processing time functions. For each combination of these, we provide a polynomial-time algorithm to find the optimal job sequence, due date values and resource allocation minimizing an objective function which includes earliness, tardiness, due date assignment, makespan and total resource consumption costs.
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/s10479-007-0269-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{2008-025-040-SI, author = {D. Shabtay and G. Steiner},
title = {The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times},
journal = {Annals of Operations Research},
year = {2008},
volume = {159},
pages = {25--40},
number = {1},
note = {Selected},
abstract = {We study the earliness-tardiness scheduling problem on a single machine with due date assignment and controllable processing times. We analyze the problem with three different due date assignment methods and two different processing time functions. For each combination of these, we provide a polynomial-time algorithm to find the optimal job sequence, due date values and resource allocation minimizing an objective function which includes earliness, tardiness, due date assignment, makespan and total resource consumption costs.},
doi = {10.1007/s10479-007-0269-y},
owner = {user},
timestamp = {2012.05.25} }