The input for MSPCLASS are problems which are known to be polynomially solvable or NP-hard and elementary reductions for scheduling problems.
The objective of these pages is to
For this purpose we developed a new computer program CLASS (Plaggenborg (1994)) and applied it to several classes of scheduling problems which are listed below. The used reduction graphs and obtained results can be found on the following pages. A * before an NP-hard problem denotes that the problem is NP-hard in the strong sense.
Note that an arc A --> B in a reduction graph means a polynomial reduction
from A to B only if the size of B is polynomially bounded by the size of A.
For notation we refer to Graham et al. (1979) and to Brucker (1998). In this book also most of the polynomial time algorithms can be found. All data are assumed to be integer.
We want to keep these pages as up to date as possible. If you have further results or any suggestions please contact us. Unpublished results should be sent to us as Latex or postscript files or as hardcopy.
Supported by the Deutsche Forschungsgemeinschaft, Project "Komplexe Maschinen-Schedulingprobleme''.
|Single machine problems|
|Parallel machine problems without preemption|
|Parallel machine problems with preemption|
|Open-shop problems without preemption|
|Open-shop problems with preemption|
|Flow-shop problems without preemption|
|Flow-shop problems with preemption|
|Job-shop problems without preemption|
|Job-shop problems with preemption|
|Open-shop problems with nowait|
|Flow-shop problems with nowait|
|Job-shop problems with nowait|
|Multiprocessor task problems with dedicated processors|
|Multiprocessor task problems with dedicated processors and preemption|
|Multiprocessor task problems with parallel processors|
|Multiprocessor task problems with parallel processors and preemption|
|Shop problems with multiprocessor tasks|
|Multipurpose machine problems|
|Shop problems with multipurpose machines|
|Serial batching problems|
|Parallel batching problems|
|Single machine problems with non-negative time-lags|
|Flow-shop problems with transportation delays|
|Open-shop problems with transportation delays|
|Flow-shop problems with transportation times and a single robot|
|Parallel machine problems with a single server|
|Flow-shop problems with a single server|