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ženo v:

Podrobná bibliografie
Vydáno v:	Journal of algorithms Ročník 45; číslo 2; s. 167 - 191
Hlavní autoři:	Jansen, Klaus, Porkolab, Lorant
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	San Diego, CA Elsevier Inc 01.11.2002 Elsevier
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!