Citation

Elvikis, D; Hamacher, H. W and T'kindt, V Scheduling two interfering job sets on uniform parallel machines with makespan and cost functions. Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland, pages 645-654, 2009.

Paper

Abstract

We consider a m uniform parallel machines scheduling problem with two jobs A and B with nA and nB operations, respectively, and equal processing times. Job A is associated with a general cost function F^A, whereas makespan is considered for job B. As we are dealing with two conflicting criteria, we focus on the calculation of strict Pareto optima for F_A and C^B_max criteria. We also tackle some particular cases of F^A and provide polynomial algorithms.

pdf

You can download the pdf of this publication from here

doi

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

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

@INPROCEEDINGS{2009-645-654-P, author = {D. Elvikis and H. W. Hamacher and V. T'kindt},
title = {Scheduling two interfering job sets on uniform parallel machines with makespan and cost functions},
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 = {645--654},
note = {Paper},
abstract = {We consider a m uniform parallel machines scheduling problem with two jobs A and B with nA and nB operations, respectively, and equal processing times. Job A is associated with a general cost function F^A, whereas makespan is considered for job B. As we are dealing with two conflicting criteria, we focus on the calculation of strict Pareto optima for F_A and C^B_max criteria. We also tackle some particular cases of F^A and provide polynomial algorithms.},
owner = {gxk},
timestamp = {2010.10.11},
webpdf = {2009-645-654-P.pdf} }