Stochastic scheduling with optimal customer service

DOI10.1057/palgrave.jors.2601063zbMath1131.90368OpenAlexW2021417211MaRDI QIDQ4658401

Victor Portougal, Dan Trietsch

Publication date: 16 March 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.2601063

zbMATH Keywords

schedulingstochastic processes

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Related Items (7)

Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times ⋮ Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine ⋮ Online traveling salesman problem with deadlines and service flexibility ⋮ Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time ⋮ A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times ⋮ Johnson's problem with stochastic processing times and optimal service level ⋮ Setting due dates in a stochastic single machine environment

This page was built for publication: Stochastic scheduling with optimal customer service