✦ LIBER ✦

Minimizing maximum lateness in a flow shop subject to release dates

✍ Scribed by Haouari, M; Ladhari, T

Book ID: 120294348
Publisher: Palgrave Publishers Ltd.
Year: 2007
Tongue: English
Weight: 184 KB
Volume: 58
Category: Article
ISSN: 0160-5682
DOI: 10.1057/palgrave.jors.2602092

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Note: Open-shop scheduling with release

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

✍ Hans Kellerer; Thomas Tautenhahn; Gerhard Woeginger 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 295 KB 👁 2 views

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.

A note on minimizing maximum lateness in

A note on minimizing maximum lateness in a one-machine sequencing problem with release dates

✍ Eugeniusz Nowicki; Stanisław Zdrzałka 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 145 KB

Minimizing maximum lateness in a two-mac

Minimizing maximum lateness in a two-machine unit-time job shop

✍ P. Brucker 📂 Article 📅 1981 🏛 Springer Vienna 🌐 English ⚖ 183 KB

Single machine scheduling to minimize ma

Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints

✍ Zhixin Liu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 161 KB

Scheduling of deteriorating jobs with re

Scheduling of deteriorating jobs with release dates to minimize the maximum lateness

✍ Miao, Cuixia; Zhang, Yuzhong; Wu, Cuilian 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 240 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