Inequalities for stochastic flow shops and job shops
From MaRDI portal
Publication:3771946
DOI10.1002/ASM.3150020106zbMath0633.90027OpenAlexW2076450843MaRDI QIDQ3771946
Sung-Hwan Wie, Michael L. Pinedo
Publication date: 1986
Published in: Applied Stochastic Models and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/asm.3150020106
makespanstochastic schedulingmajorizationvariability orderingoptimal job sequencestwo-machine job shopexpected waiting costsm- machine flow shopsmallest variance first rule
Related Items (9)
Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times ⋮ Single-machine scheduling with general costs under compound-type distributions ⋮ A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures ⋮ STOCHASTIC BATCH SCHEDULING AND THE “SMALLEST VARIANCE FIRST” RULE ⋮ Stochastic Flow-Shop Scheduling with Lateness-Related Performance Measures ⋮ A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial Ordering ⋮ A Note on One-Machine Scheduling Problems with Imperfect Information ⋮ On Optimal Permutation Scheduling in Stochastic Proportionate Flowshops ⋮ An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns
Cites Work
This page was built for publication: Inequalities for stochastic flow shops and job shops