Stochastic scheduling problems with general position-based learning effects and stochastic breakdowns

2012 ◽  
Vol 16 (3) ◽  
pp. 331-336 ◽  
Author(s):  
Yebin Zhang ◽  
Xianyi Wu ◽  
Xian Zhou
2009 ◽  
Vol 179 (14) ◽  
pp. 2416-2425 ◽  
Author(s):  
Yunqiang Yin ◽  
Dehua Xu ◽  
Kaibiao Sun ◽  
Hongxing Li

Scheduling ◽  
2011 ◽  
pp. 607-610 ◽  
Author(s):  
Michael L. Pinedo

1991 ◽  
Vol 23 (01) ◽  
pp. 86-104 ◽  
Author(s):  
K. D. Glazebrook

A single machine is available to process a collection J of jobs. The machine is free to switch between jobs at any time, but processing must respect a set Γof precedence constraints. Jobs evolve stochastically and earn rewards as they are processed, not otherwise. The theoretical framework of forwards induction/Gittins indexation is used to develop approaches to strategy evaluation for quite general (J,Γ). The performance of both forwards induction strategies and a class of quasi-myopic heuristics is assessed.


Sign in / Sign up

Export Citation Format

Share Document