License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2011.380
URN: urn:nbn:de:0030-drops-30282
URL: http://drops.dagstuhl.de/opus/volltexte/2011/3028/
Go to the corresponding Portal


Lopez-Ortiz, Alejandro ; Quimper, Claude-Guy

A Fast Algorithm for Multi-Machine Scheduling Problems with Jobs of Equal Processing Times

pdf-format:
Document 1.pdf (788 KB)


Abstract

Consider the problem of scheduling a set of tasks of length p without preemption on $m$ identical machines with given release and deadline times. We present a new algorithm for computing the schedule with minimal completion times and makespan. The algorithm has time complexity O(min(1,p/m)n^2) which improves substantially over the best known algorithm with complexity O(mn^2).

BibTeX - Entry

@InProceedings{lopezortiz_et_al:LIPIcs:2011:3028,
  author =	{Alejandro Lopez-Ortiz and Claude-Guy Quimper},
  title =	{{A Fast Algorithm for Multi-Machine Scheduling Problems with Jobs of Equal Processing Times}},
  booktitle =	{28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011) },
  pages =	{380--391},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-25-5},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{9},
  editor =	{Thomas Schwentick and Christoph D{\"u}rr},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/3028},
  URN =		{urn:nbn:de:0030-drops-30282},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.STACS.2011.380},
  annote =	{Keywords: Scheduling}
}

Keywords: Scheduling
Seminar: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)
Issue Date: 2011
Date of publication: 11.03.2011


DROPS-Home | Fulltext Search | Imprint Published by LZI