scientific article
From MaRDI portal
Publication:3801319
zbMATH Open0654.90037MaRDI QIDQ3801319
Parkash Lal Maggu, Rajiv Brandari
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures ⋮ Unnamed Item
Recommendations
- A contribution and new heuristics for open shop scheduling 👍 👎
- On the complexity of preemptive open-shop scheduling problems 👍 👎
- A Note On The Complexity Of Openshop Scheduling Problems 👍 👎
- The Open Shop Scheduling Problem 👍 👎
- Inequalities and Bounds in Stochastic Shop Scheduling 👍 👎
- Stochastic scheduling for a two-machine open shop 👍 👎
- Stochastic Algorithms: Foundations and Applications 👍 👎
- Solving the open shop scheduling problem 👍 👎
- On the complexity of open shop scheduling with time lags 👍 👎
This page was built for publication:
