Polynomial time approximation schemes for general multiprocessor job shop scheduling

We study preemptive and non-preemptive versions of the general multiprocessor job shop scheduling problem: Given a set of n tasks each consisting of at most μ ordered operations that can be processed on different (possibly all) subsets of m machines with different processing times, compute a schedul...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of algorithms Jg. 45; H. 2; S. 167 - 191
Hauptverfasser:	Jansen, Klaus, Porkolab, Lorant
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	San Diego, CA Elsevier Inc 01.11.2002 Elsevier
Schlagworte:	Applied sciences Computer science; control theory; systems Computer systems performance. Reliability Exact sciences and technology Operational research and scientific management Operational research. Management science Scheduling, sequencing Software Polynomial Minimum Scheme Polynomial approximation Job shop Processing time Process Makespan Approximation algorithm Machine Result Numerical approximation Multiprocessor Accuracy Development Shift Order Linear programming Scheduling Algorithm Flow Polynomial time Optimal solution Schedule Models Problem
ISSN:	0196-6774, 1090-2678
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!