Citation
A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates. Journal of Scheduling, 14 (5): 455-469, 2011.
Selected
Abstract
We study a single-machine scheduling problem in a flexible framework where both job processing times and due dates are decision variables to be determined by the scheduler. The model can also be applied for quoting delivery times when some parts of the jobs may be outsourced. We analyze the problem for two due date assignment methods and a convex resource consumption function. For each due date assignment method, we provide a bicriteria analysis where the first criterion is to minimize the total weighted number of tardy jobs plus due date assignment cost, and the second criterion is to minimize total weighted resource consumption. We consider four different models for treating the two criteria. Although the problem of minimizing a single integrated objective function can be solved in polynomial time, we prove that the three bicriteria models are NP-hard for both due date assignment methods. We also present special cases, which frequently occur in practice, and in which all four models are polynomially solvable.
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-010-0208-7 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{2011-455-469-SI, author = {D. Shabtay and G. Steiner},
title = {A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates},
journal = {Journal of Scheduling},
year = {2011},
volume = {14},
pages = {455--469},
number = {5},
note = {Selected},
abstract = {We study a single-machine scheduling problem in a flexible framework where both job processing times and due dates are decision variables to be determined by the scheduler. The model can also be applied for quoting delivery times when some parts of the jobs may be outsourced. We analyze the problem for two due date assignment methods and a convex resource consumption function. For each due date assignment method, we provide a bicriteria analysis where the first criterion is to minimize the total weighted number of tardy jobs plus due date assignment cost, and the second criterion is to minimize total weighted resource consumption. We consider four different models for treating the two criteria. Although the problem of minimizing a single integrated objective function can be solved in polynomial time, we prove that the three bicriteria models are NP-hard for both due date assignment methods. We also present special cases, which frequently occur in practice, and in which all four models are polynomially solvable.},
doi = {10.1007/s10951-010-0208-7},
owner = {user},
timestamp = {2012.05.25} }