A Note on Stochastic Shop Models in Which Jobs have the Same Processing Requirements on Each Machine

DOI10.1287/MNSC.31.7.840MaRDI QIDQ3754428zbMATH OpenOpenAlexFDO

Authors Michael L. Pinedo

Publication date 1985

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.31.7.840

zbMATH Keywords

makespanflow timejob shopsflow shopsStochastic modelsopen shopsmonotone likelihood ratio ordering

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Inequalities and Bounds in Stochastic Shop Scheduling
• Stochastically minimizing the makespan in flow shops
• Inequalities for stochastic flow shops and job shops
• On three-machine flow shops with random job processing times
• Minimizing the Makespan and Flowtime in Two-Machine Stochastic Open Shops

Cited in

(9)

• Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops
• Inequalities for stochastic flow shops and job shops
• Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival
• Reducing the Congestion in a Class of Job Shops
• Proportionate flow shop with controllable processing times
• The three-machine proportionate flow shop problem with unequal machine speeds
• Inequalities and Bounds in Stochastic Shop Scheduling
• On the optimality of static policy in stochastic open shop
• Flow shops with reentry: reversibility properties and makespan optimal schedules

This page was built for publication: A Note on Stochastic Shop Models in Which Jobs have the Same Processing Requirements on Each Machine

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