Stochastic scheduling for a two-machine open shop

DOI10.2307/3215098zbMATH Open0891.90085OpenAlexW2325608155MaRDI QIDQ4364879

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

makespanstochastic schedulingcouplingpreemptive schedulingtwo-machine open shop

Mathematics Subject Classification ID

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

Related Items (3)

Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Minimizing the Makespan and Flowtime in Two-Machine Stochastic Open Shops ⋮ Unnamed Item

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Two machine openshop scheduling with machine-dependent processing times 👍 👎
• Two-stage open shop scheduling with a bottleneck machine 👍 👎
• Scheduling the two-machine open shop problem under resource constraints for setting the jobs 👍 👎
• Minimizing the Makespan and Flowtime in Two-Machine Stochastic Open Shops 👍 👎
• Two-machine open shop scheduling with an availability constraint 👍 👎

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