Single Machine Scheduling with Interfering Job Sets. Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland, pages 357-365, 2009.

Paper

We consider a bicriteria scheduling problem for a single machine in which jobs belong to either of two different disjoint sets, each set having its own performance measure. The problem has been referred to as interfering job sets in the scheduling literature and also been called multi-agent scheduling where each agent's objective function is to be minimized. The performance criteria specifically selected in this paper are minimizing total completion time and number of tardy jobs for the two set of jobs. We present a forward SPT-EDD heuristic to generate the set of all non-dominated solutions for this problem considering a single machine environment where all the jobs are available at time zero and the jobs are not allowed to be preempted. The complexity of this specific problem is still open; however some pseudo-polynomial algorithms have been suggested by earlier researchers which have been used to compare the results from the proposed heuristic.

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{2009-357-365-P, author = {K. Khowala and J. Fowler and A. Keha and H. Balasubramanian},

title = {Single Machine Scheduling with Interfering Job Sets},

booktitle = {Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland},

year = {2009},

editor = {J. Blazewicz and M. Drozdowski and G. Kendall and B. McCollum},

pages = {357--365},

note = {Paper},

abstract = {We consider a bicriteria scheduling problem for a single machine in which jobs belong to either of two different disjoint sets, each set having its own performance measure. The problem has been referred to as interfering job sets in the scheduling literature and also been called multi-agent scheduling where each agent's objective function is to be minimized. The performance criteria specifically selected in this paper are minimizing total completion time and number of tardy jobs for the two set of jobs. We present a forward SPT-EDD heuristic to generate the set of all non-dominated solutions for this problem considering a single machine environment where all the jobs are available at time zero and the jobs are not allowed to be preempted. The complexity of this specific problem is still open; however some pseudo-polynomial algorithms have been suggested by earlier researchers which have been used to compare the results from the proposed heuristic.},

owner = {gxk},

timestamp = {2010.10.11},

webpdf = {2009-357-365-P.pdf} }