Inequalities for stochastic flow shops and job shops

DOI10.1002/asm.3150020106zbMath0633.90027MaRDI QIDQ3771946

Michael L. Pinedo, Sung-Hwan Wie

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

zbMATH Keywords

makespan; stochastic scheduling; majorization; variability ordering; optimal job sequences; two-machine job shop; expected waiting costs; m- machine flow shop; smallest variance first rule

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

STOCHASTIC BATCH SCHEDULING AND THE “SMALLEST VARIANCE FIRST” RULE, Single-machine scheduling with general costs under compound-type distributions, An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns, A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures, Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times, 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

Cites Work

• The Efficiency Analysis of Choices Involving Risk
• Inequalities: theory of majorization and its applications