Makespan-related criteria for comparing schedules in stochastic environments
From MaRDI portal
Publication:3157793
DOI10.1057/palgrave.jors.2600639zbMath1140.90417OpenAlexW2149166432MaRDI QIDQ3157793
Dan Trietsch, Victor Portougal
Publication date: 19 January 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600639
Related Items
Minimizing makespan of stochastic customer orders in cellular manufacturing systems with parallel machines ⋮ Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness ⋮ Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time ⋮ Analytic evaluation of the expectation and variance of different performance measures of a schedule on a single machine under processing time variability ⋮ A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation ⋮ Johnson's problem with stochastic processing times and optimal service level
