Minimizing variation in stochastic flow shop

DOI10.1016/S0167-6377(98)00039-XzbMath0957.90067OpenAlexW2013506466WikidataQ127202864 ScholiaQ127202864MaRDI QIDQ1306384

Chunfu Jia

Publication date: 1998

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(98)00039-x

zbMATH Keywords

schedulingstochastic orderflow shop

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Related Items

Two-machine stochastic flow shops with blocking and the traveling salesman problem ⋮ A contribution to the stochastic flow shop scheduling problem.

Cites Work

• Rearrangement, Majorization and Stochastic Scheduling
• Stochastically minimizing the makespan in flow shops
• Minimizing the Expected Makespan in Stochastic Flow Shops