✦ LIBER ✦

Job-shop scheduling to minimize total waiting time

✍ Scribed by Chu, Chengbin ;Portmann, Marie-Claude

Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 538 KB
Volume: 9
Category: Article
ISSN: 8755-0024
DOI: 10.1002/asm.3150090210

No coin nor oath required. For personal study only.

📜 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

Steady state waiting time in a multicent

Steady state waiting time in a multicenter job shop

✍ Asha S. Kapadia; Bartholomew P. Hsi 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 280 KB

Scheduling deteriorating jobs to minimiz

Scheduling deteriorating jobs to minimize makespan

✍ Wieslaw Kubiak; Steef van de Velde 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB

We consider a single-machine problem of scheduling n independent jobs to minimize makespan, in which the processing time of job J j grows by w j with each time unit its start is delayed beyond a given common critical date d. This processing time is p j if J j starts by d. We show that this problem i

Flow-shop batch scheduling with identica

Flow-shop batch scheduling with identical processing-time jobs

✍ Gur Mosheiov; Daniel Oron; Yaacov Ritov 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 264 KB

Polynomial-time approximation scheme for

Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time

✍ T.C. Edwin Cheng; Qingqin Nong; Chi To Ng 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB 👁 1 views

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.