Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
Recent Results for Online Makespan Minimization
(Extended Abstract)
verfasst von : Susanne Albers
Erschienen in: Computing and Combinatorics
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Overview:
We study a classical scheduling problem that has been investigated for more than forty years. Consider a sequence of jobs
σ
=
J
1
, …,
J
n
that has to be scheduled on
m
identical parallel machines. Each job
J
t
has an individual processing time
p
t
, 1 ≤
t
≤
n
. Preemption of jobs is not allowed. The goal is to minimize the makespan, i.e. the maximum completion time of any job in the constructed schedule. In the offline variant of the problem all jobs of
σ
are known in advance. In the online variant the jobs arrive one by one. Each incoming job
J
t
has to be assigned immediately to one of the machines without knowledge of any future jobs
J
t
′
,
t
′ >
t
.