scholarly journals Optimal Start Times for a Flow Shop with Blocking Constraints, No-Wait Constraints, and Stochastic Processing Times

2021 ◽  
Vol 54 (1) ◽  
pp. 659-664
Author(s):  
M. Kowalski ◽  
A. Steinboeck ◽  
A. Aschauer ◽  
A. Kugi
1995 ◽  
Vol 27 (03) ◽  
pp. 821-839 ◽  
Author(s):  
Gideon Weiss

We consider scheduling a batch of jobs with stochastic processing times on single or parallel machines, with the objective of minimizing the expected holding costs. Preemption of jobs is allowed, and the holding costs of preempted jobs may depend on the stage of completion. We provide a new proof of the optimality of a Gittins priority rule for the single machine and use the same proof to show that the Gittins priority rule is nearly optimal for parallel machines.


1995 ◽  
Vol 27 (3) ◽  
pp. 821-839 ◽  
Author(s):  
Gideon Weiss

We consider scheduling a batch of jobs with stochastic processing times on single or parallel machines, with the objective of minimizing the expected holding costs. Preemption of jobs is allowed, and the holding costs of preempted jobs may depend on the stage of completion. We provide a new proof of the optimality of a Gittins priority rule for the single machine and use the same proof to show that the Gittins priority rule is nearly optimal for parallel machines.


Sign in / Sign up

Export Citation Format

Share Document