Bicriteria Scheduling Of Equal Length Jobs With Release Dates On Identical Parallel Machines. In proceedings of the 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), 18 -21 July 2005, New York, USA, pages 112-122, 2005.

Paper

We consider bicriteria scheduling problems on parallel, identical machines with job release dates. The jobs are assumed to have equal processing times. Our main goal in this paper is to report complexity results for bicriteria problems in this environment when the number of machines is assumed to be a fixed or constant value. The results are based on a straightforward use of the dynamic program of Baptiste (2000). When the the number of machines is given, we show that it is possible to minimize, in polynomial time, a composite linear objective function involving 1) sum of completion times and total tardiness, and 2) under a given condition the sum of weighted completion times and total tardiness. We then use a technique proposed by Aneja and Nair (1979) to generate extreme schedules on the efficient frontier for the first problem and a subset of them for the second one. We also show that it is possible to generate in polynomial time the set of Pareto Optimal points for bicriteria problems with C_max as one of the criteria and either of SUM(w_i*C_j) and SUM(T_j) as the other

You can download the pdf of this publication from **here**

This publication does not have a doi, so we cannot provide a link to the original source

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

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.

@INPROCEEDINGS{2005-112-122-P, author = {H. Balasubramanian and J. Fowler and A. Keha},

title = {Bicriteria Scheduling Of Equal Length Jobs With Release Dates On Identical Parallel Machines},

booktitle = {In proceedings of the 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), 18 -21 July 2005, New York, USA},

year = {2005},

editor = {G. Kendall and L. Lei and M. Pinedo},

pages = {112--122},

note = {Paper},

abstract = {We consider bicriteria scheduling problems on parallel, identical machines with job release dates. The jobs are assumed to have equal processing times. Our main goal in this paper is to report complexity results for bicriteria problems in this environment when the number of machines is assumed to be a fixed or constant value. The results are based on a straightforward use of the dynamic program of Baptiste (2000). When the the number of machines is given, we show that it is possible to minimize, in polynomial time, a composite linear objective function involving 1) sum of completion times and total tardiness, and 2) under a given condition the sum of weighted completion times and total tardiness. We then use a technique proposed by Aneja and Nair (1979) to generate extreme schedules on the efficient frontier for the first problem and a subset of them for the second one. We also show that it is possible to generate in polynomial time the set of Pareto Optimal points for bicriteria problems with C_max as one of the criteria and either of SUM(w_i*C_j) and SUM(T_j) as the other},

owner = {Faizah Hamdan},

timestamp = {2012.05.21},

webpdf = {2005-112-122-P.pdf} }