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...

Resource limitation in zero time may cause to some profitable projects not to be selected in project selection problem, thus simultaneous project portfolio selection and scheduling problem has received significant attention. In this study, budget, investment costs and earnings are considered to be stochastic. The objectives are maximizing net present values of selected projects and minimizing v...

Two important characteristics encountered in many real-world scheduling problems are heterogeneous processors and a certain degree of uncertainty about the sizes of jobs. In this paper we address both, and study for the first time a scheduling problem that combines the classical unrelated machine scheduling model with stochastic processing times of jobs. By means of a novel time-indexed linear ...

Online scheduling (also known as dynamic scheduling) refers to the real-time coordination of operation processing while new operations are continuously arriving. The objective of this paper is the study of different online scheduling techniques in a dynamic, stochastic job shop scheduling environment. We present a quantitative study of the quality of dispatching and optimizing scheduling techni...