97-20
Optimal Makespan Scheduling with Given Bounds of Processing Times
by Lai, T.-C.; Sotskov, Y.N.; Sotskova, N.Y.; Werner, F.
Preprint series: 97-20, Preprints
The paper is published: Mathematical and Computer Modelling, Vol. 26, 1997, No. 3, 67 - 86.
Abstract: 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.
Keywords: - General shop scheduling, Makespan, Mixed graph, Uncertain processing times
Notes: Supported by National Science Council of Taiwan under NSC 86-2416-H002-002 Supported by Deutsche Forschungsgemeinschaft (Project ScheMA) and by INTAS(Project 93-257).
The author(s) agree, that this abstract may be stored asfull text and distributed as such by abstracting services.