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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of algorithms Ročník 45; číslo 2; s. 167 - 191
Hlavní autori:	Jansen, Klaus, Porkolab, Lorant
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	San Diego, CA Elsevier Inc 01.11.2002 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!