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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of algorithms Vol. 45; no. 2; pp. 167 - 191
Main Authors:	Jansen, Klaus, Porkolab, Lorant
Format:	Journal Article
Language:	English
Published:	San Diego, CA Elsevier Inc 01.11.2002 Elsevier
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!