Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival

DOI10.1016/0022-247X(88)90419-2zbMath0659.90057OpenAlexW2020298013MaRDI QIDQ1112720

Bidhu B. Mohanty, Chia-Shin Chung

Publication date: 1988

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(88)90419-2

zbMATH Keywords

Markov processPoisson arrivalexpected makespanLongest expected processing timemachine loading ruletwo-machine stochastic open shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Related Items (1)

Four decades of research on the open-shop scheduling problem to minimize the makespan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the flow time and the number of tardy jobs in stochastic open shops
• On the complexity of preemptive open-shop scheduling problems
• The mixed shop scheduling problem
• Openshop and flowshop scheduling to minimize sum of completion times
• An efficient algorithm for the job-shop problem with two jobs
• TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH CONTROLLABLE MACHINE SPEEDS
• A Note on Stochastic Shop Models in Which Jobs have the Same Processing Requirements on Each Machine
• A Note on Open Shop Preemptive Schedules
• Complexity of Scheduling Shops with No Wait in Process
• Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
• Minimizing expected makespan in stochastic open shops
• Scheduling Jobs with Exponential Processing and Arrival Times on Identical Processors so as to Minimize the Expected Makespan
• Minimizing Maximum Lateness in a Two-Machine Open Shop
• Unit Execution Time Shop Problems
• Open Shop Scheduling to Minimize Finish Time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• An Algorithm for the Open-Shop Problem
• Negative Dynamic Programming

This page was built for publication: Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival