✦ LIBER ✦

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

✍ Scribed by Chia-Shin Chung; Bidhu B Mohanty

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 517 KB
Volume: 133
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(88)90419-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing the makespan in open-shop sch

Minimizing the makespan in open-shop scheduling problems with a convex resource consumption function

✍ Dvir Shabtay; Moshe Kaspi 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB

Fast algorithms to minimize the makespan

Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times

✍ Jinliang Cheng; George Steiner; Paul Stephenson 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 186 KB 👁 2 views

We consider the two-machine ow-shop problem with release times where the objective is to minimize either the makespan or the maximum lateness. We present a uniÿed treatment of various sequenceinterchange operators and derive powerful new dominance orders, which are incorporated into branchand-bound