✦ LIBER ✦

Note: Open-shop scheduling with release dates to minimize maximum lateness

✍ Scribed by Hans Kellerer; Thomas Tautenhahn; Gerhard Woeginger

Publisher: John Wiley and Sons
Year: 1995
Tongue: English
Weight: 295 KB
Volume: 42
Category: Article
ISSN: 0894-069X
DOI: 10.1002/1520-6750(199502)42:1<141::aid-nav3220420111>3.0.co;2-3

No coin nor oath required. For personal study only.

✦ Synopsis

We present the first polynomial-time algorithm for an open-shop problem with unit execution times, arbitrary release dates, and due dates. The objective is to minimize maximum lateness. 0 I995 John Wiley & Sons. Inc.

📜 SIMILAR VOLUMES

Open shop scheduling to minimize the num

Open shop scheduling to minimize the number of late jobs

✍ Christos Koulamas; George J. Kyparisis 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 63 KB 👁 2 views

We develop polynomial algorithms for several cases of the NP-hard open shop scheduling problem of minimizing the number of late jobs by utilizing some recent results for the open shop makespan problem. For the two machine common due date problem, we assume that either the machines or the jobs are or

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 👁 1 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