✦ LIBER ✦

Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness

✍ Scribed by Ali Allahverdi

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 559 KB
Volume: 23
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(96)00012-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Heuristics for the two-machine flowshop

Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times

✍ Ali Allahverdi; Harun Aydilek 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 870 KB

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.

Scheduling on a two-machine flowshop sub

Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function

✍ Ali Allahverdi; John Mittenthal 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 716 KB

Minimizing makespan in a two-machine flo

Minimizing makespan in a two-machine flowshop scheduling with batching and release time

✍ Lixin Tang; Peng Liu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 721 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

Single-Machine Scheduling to Minimize a

Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria

✍ J.A. Hoogeveen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 210 KB

We consider the problem of scheduling n jobs on a single machine that is continuously available from time zero onward and that can handle no more than one job at a time. Each job requires processing during a given positive uninter-Ž . rupted time. The cost of each job is measured by K Ks2, 3 nondecr