Optimal match-up strategies in stochastic scheduling
نویسندگان
چکیده
منابع مشابه
Match-up scheduling under a machine breakdown
When a machine breakdown forces a modi®ed ̄ow shop (MFS) out of the prescribed state, the proposed strategy reschedules part of the initial schedule to match up with the preschedule at some point. The objective is to create a new schedule that is consistent with the other production planning decisions like material ̄ow, tooling and purchasing by utilizing the time critical decision making conce...
متن کاملMatch-up strategies and fuzzy robust scheduling for a complex dynamic real world job shop scheduling problem
This thesis investigate a complex real world job shop scheduling / rescheduling problem, in which the presence of uncertainties and the occurrence of disruptions are tackled to produce efficient and reliable solutions. New orders arrive every day in the shop floor and they have to be integrated in the existent schedule. Match-up algorithms are introduced to collect the idle time on machines and...
متن کاملBounds on optimal values in stochastic scheduling
Consistent stochastic orders of processing times and objective functions yield optimal policies in many stochastic scheduling problems. When these orders fail to hold, however, finding optimal values may be difficult. In this paper, we show how to bound these values in general situations including problems with unreliable machines and tardiness-based objectives.
متن کاملParallel machine match-up scheduling with manufacturing cost considerations
Many scheduling problems in practice involve rescheduling of disrupted schedules. In this study, we show that in contrast to fixed processing times, if we have the flexibility to control the processing times of the jobs, we can generate alternative reactive schedules considering the manufacturing cost implications in response to disruptions. We consider a non-identical parallel machining enviro...
متن کاملOptimal Factory Scheduling using Stochastic Dominance A*
We examine a standard factory scheduling problem with stochastic processing and setup times, minimizing the expectation of the weighted number of tardy jobs. Because the costs of operators in the schedule are stochastic and sequence dependent, standard dynamic programming algorithms such as A* may fail to find the optimal schedule. The SDA * (Stochastic Dominance A*) algo rithm remedies this d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1995
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00098-x