Zurück zu den Preprints des Jahres 1997


Optimal Makespan Scheduling with Given Bounds of Processing Times

by Lai, T.-C., Sotskov, Y.N., Sotskova, N.Y., Werner, F..

Series: 1997-20, Preprints

90B35 Scheduling theory, deterministic
90C27 Combinatorial optimization

with the objective of minimizing the makespan under uncertain scheduling
environments. The processing time of an operation is usually assumed to
take a known probability distribution function when dealing with uncertain
scheduling environments. The scheduling environments that we consider in
this paper are so uncertain that all information available about the processing
time of an operation is an upper and lower bound. We present an approach
to deal with such a situation based on an improved stability analysis of an
optimal makespan schedule and demonstrate this approach on an illustrative
example of the job shop scheduling problem.

- General shop scheduling, Makespan, Mixed graph, Uncertain processing times

This paper was published in:
Mathematical and Computer Modelling, Vol. 26, 1997, No. 3, 67 - 86.