Similar Search Results

Approximations to stochastic dynamic programs via information relaxation duality

Balseiro, Santiago R.; Brown, David B. - In: Operations research 67 (2019) 2, pp. 577-597

Persistent link: https://www.econbiz.de/10012022386

Static routing in stochastic scheduling : performance guarantees and asymptotic optimality

Balseiro, Santiago R.; Brown, David B.; Chen, Chen - In: Operations research 66 (2018) 6, pp. 1641-1660

Persistent link: https://www.econbiz.de/10011971699

On index policies for stochastic minsum scheduling

Eberle, Franziska; Fischer, Felix; Matuschke, Jannik; … - In: Operations research letters 47 (2019) 3, pp. 213-218

Persistent link: https://www.econbiz.de/10012017650

A stochastic scheduling approach to minimise the number of risky jobs and total probability of tardiness

Egilmez, Gokhan; Arinsoy, Aslican; Süer, Gürsel A. - In: International journal of services and operations management 30 (2018) 2, pp. 186-202

Persistent link: https://www.econbiz.de/10011886148

Single machine scheduling with stochastically dependent times

Wei, Wei - In: Journal of scheduling 22 (2019) 6, pp. 677-689

Persistent link: https://www.econbiz.de/10012125314

Combining two-stage stochastic programming and recoverable robustness to minimize the number of late jobs in the case of uncertain processing times

Akker, J. M. van den; Hoogeveen, Han; Stoef, Judith - In: Journal of scheduling 21 (2018) 6, pp. 607-617

Persistent link: https://www.econbiz.de/10011955845

A sequential stochastic mixed integer programming model for tactical master surgery scheduling

Kumar, Ashwani; Costa, Alysson Machado; Fackrell, Mark; … - In: European journal of operational research : EJOR 270 (2018) 2, pp. 734-746

Persistent link: https://www.econbiz.de/10011869439

Stochastic customer order scheduling with setup times to minimize expected cycle time

Zhao, Yaping; Xu, Xiaoyun; Li, Haidong; Liu, Yanni - In: International journal of production research 56 (2018) 7, pp. 2684-2706

Persistent link: https://www.econbiz.de/10011873976

Time complexity of single- and identical parallel-machine scheduling with GERT network precedence constraints

Zimmermann, Jürgen - In: Mathematical Methods of Operations Research 49 (1999) 2, pp. 221-238

In this paper we deal with the time complexity of single- and identical parallel-machine scheduling problems in which the durations and precedence constraints of the activities are stochastic. The stochastic precedence constraints are given by GERT networks. First, we sketch the basic concepts...

Persistent link: https://www.econbiz.de/10010999597

Beyond the cμ rule: Dynamic scheduling of a two-class loss queue

Kim, Eungab; Oyen, Mark P. Van - In: Mathematical Methods of Operations Research 48 (1998) 1, pp. 17-36

We consider scheduling a single server in a two-class M/M/1 queueing system with finite buffers subject to holding costs and rejection costs for rejected jobs. We use dynamic programming to investigate the structural properties of optimal policies. Provided that the delay of serving a job is...

Persistent link: https://www.econbiz.de/10010999640