Stochastic scheduling for a two-machine open shop

DOI10.2307/3215098MaRDI QIDQ4364879zbMATH OpenOpenAlexFDO

Authors Rhonda Righter

Publication date 12 July 1998

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/3215098

zbMATH Keywords

couplingmakespanpreemptive schedulingstochastic schedulingtwo-machine open shop

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4068593
• scientific article; zbMATH DE number 5260089
• Minimizing the Makespan and Flowtime in Two-Machine Stochastic Open Shops
• Two-machine open shop scheduling with machine-dependent processing times
• Two machine openshop scheduling with machine-dependent processing times
• Two-machine open shop scheduling with an availability constraint
• Scheduling the two-machine open shop problem under resource constraints for setting the jobs
• Two-stage open shop scheduling with a bottleneck machine

Cited in

(8)

• Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival
• On the optimality of static policy in stochastic open shop
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines
• scientific article; zbMATH DE number 4068593 (Why is no real title available?)
• Exponentially distributed jobshop scheduling problems.
• scientific article; zbMATH DE number 4099021 (Why is no real title available?)
• Minimizing the Makespan and Flowtime in Two-Machine Stochastic Open Shops

This page was built for publication: Stochastic scheduling for a two-machine open shop

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