Minimizing variation in stochastic flow shop

DOI10.1016/S0167-6377(98)00039-XzbMATH Open0957.90067OpenAlexW2013506466WikidataQ127202864 ScholiaQ127202864MaRDI QIDQ1306384FDOQ1306384

Authors: 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

Recommendations

• Inequalities for stochastic flow shops and job shops
• On Minimizing the Expected Makespan and Flow Time in Stochastic Flow Shops with Blocking
• Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops
• Stochastic flowshop no-wait scheduling

zbMATH Keywords

schedulingflow shopstochastic order

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Cites Work

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

Cited In (6)

• On Minimizing the Expected Makespan and Flow Time in Stochastic Flow Shops with Blocking
• Inequalities for stochastic flow shops and job shops
• A mean-variance model for the minimum cost flow problem with stochastic arc costs
• Mean‐standard deviation model for minimum cost flow problem
• Two-machine stochastic flow shops with blocking and the traveling salesman problem
• A contribution to the stochastic flow shop scheduling problem.

This page was built for publication: Minimizing variation in stochastic flow shop

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306384)