We present a novel approach to synthesize good schedules for a class of scheduling problems that is slightly more general than the scheduling problem FJm,a|gpr,r_j,d_j|early/tardy. The idea is to prime the schedule synthesizer with stochastic information more meaningful than performance factors with the objective to minimize the expected cost caused by storage or delay. The priming information is obtained by stochastic simulation of the system environment. The generated schedules are assessed again by simulation. The approach is demonstrated by means of a non-trivial scheduling problem from lacquer production. The experimental results show that our approach achieves in all considered scenarios better results than the extended processing times approach.
|Place of Publication||Enschede|
|Publisher||Centre for Telematics and Information Technology (CTIT)|
|Number of pages||27|
|Publication status||Published - Feb 2006|
|Name||CTIT Technical Report Series|
|Publisher||Centre for Telematics and Information Technology, University of Twente|
Mader, A. H., Bohnenkamp, H. C., Usenko, Y. S., Jansen, D. N., Hurink, J. L., & Hermanns, H. (2006). Synthesis and Stochastic Assessment of Cost-Optimal Schedules. (CTIT Technical Report Series; No. 06-14). Enschede: Centre for Telematics and Information Technology (CTIT).