✦ LIBER ✦

Stochastically minimizing the makespan in flow shops

✍ Scribed by R. D. Foley; S. Suresh

Publisher: John Wiley and Sons
Year: 1984
Tongue: English
Weight: 343 KB
Volume: 31
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800310405

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing expected makespan in a two-ma

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

✍ Chia-Shin Chung; Bidhu B Mohanty 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 517 KB

Minimizing Mean Flow Time in Two-Machine

Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops

✍ J.Z. Du; J.Y.T. Leung 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 770 KB

Minimizing makespan in a multimode multi

Minimizing makespan in a multimode multiprocessor shop scheduling problem

✍ Lucio Bianco; Paolo Dell'Olmo; Stefano Giordani; Maria Grazia Speranza 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB

We study the problem of multimode scheduling tasks on dedicated processors, with the objective of minimizing the maximum completion time. Each task can be undertaken in one among a set of predefined alternative modes, where each mode specifies a required set of dedicated processors and a processing

Minimizing total expected costs in the t

Minimizing total expected costs in the two-machine, stochastic flow shop

✍ Frank G Forst 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 368 KB

Minimizing the expected weighted number

Minimizing the expected weighted number of tardy jobs in stochastic flow shops

✍ O.J. Boxma; F.G. Forst 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 492 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