Minimizing the Makespan and Flowtime in Two-Machine Stochastic Open Shops

DOI10.1017/S0269964800004563MaRDI QIDQ5485388zbMATH OpenOpenAlexFDO

Authors Tian-Shyug Lee, Georgia-Ann Klutke

Publication date 30 August 2006

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0269964800004563

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival
• Stochastically minimizing the makespan in flow shops
• Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops
• Stochastic Minimization of the Makespan in Flow Shops with Identical Machines and Buffers of Arbitrary Size
• Stochastic scheduling for a two-machine open shop
• Two-stage flow-open shop scheduling problem to minimize makespan

Cites work

• A note on the two machine job shop with exponential processing times
• scientific article; zbMATH DE number 3852171 (Why is no real title available?)
• Minimizing expected makespan in stochastic open shops
• Minimizing the Expected Makespan in Stochastic Flow Shops
• On Johnson's Two-Machine Flow Shop with Random Processing Times
• On the optimality of static policy in stochastic open shop
• Open Shop Scheduling to Minimize Finish Time
• Open shop scheduling with machine dependent processing times
• Optimal two- and three-stage production schedules with set-up time included
• Stochastically minimizing the makespan in flow shops

Cited in

(13)

• Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival
• On the optimality of static policy in stochastic open shop
• Stochastically minimizing the makespan in two-machine flow shops without blocking
• Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage
• A cyclical search for the two machine flow shop and open shop to minimise finishing time
• A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures
• A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation
• Stochastically minimizing the makespan in flow shops
• On Pinedo's Conjecture for Scheduling in a Stochastic Flow Shop
• A Note on Stochastic Shop Models in Which Jobs have the Same Processing Requirements on Each Machine
• Schedulingn nonoverlapping jobs and two stochastic jobs in a flow shop
• Stochastic scheduling for a two-machine open shop
• Two-machine stochastic flow shops with blocking and the traveling salesman problem

This page was built for publication: Minimizing the Makespan and Flowtime in Two-Machine Stochastic Open Shops

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