A Fast Algorithm for Multi-Machine Scheduling Problems with Jobs of Equal Processing Times - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

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

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, \frac{p}{m})n^2)$ which improves substantially over the best known algorithm with complexity $O(mn^2)$.
Fichier principal
Vignette du fichier
36.pdf (273.26 Ko) Télécharger le fichier
Origin Explicit agreement for this submission
Loading...

Dates and versions

hal-00573624 , version 1 (05-03-2011)

Identifiers

  • HAL Id : hal-00573624 , version 1

Cite

Alejandro Lopez-Ortiz, Claude-Guy Quimper. A Fast Algorithm for Multi-Machine Scheduling Problems with Jobs of Equal Processing Times. Symposium on Theoretical Aspects of Computer Science (STACS2011), Mar 2011, Dortmund, Germany. pp.380-391. ⟨hal-00573624⟩

Collections

STACS2011
79 View
273 Download

Share

Gmail Mastodon Facebook X LinkedIn More