✦ LIBER ✦

Single machine scheduling with batch deliveries

✍ Scribed by T.C.Edwin Cheng; Valery S. Gordon; Mikhail Y. Kovalyov

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 584 KB
Volume: 94
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(96)00127-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Analysis of approximation algorithms for

Analysis of approximation algorithms for single-machine scheduling with delivery times and sequence independent batch setup times

✍ Stanisław Zdrzałka 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 695 KB

A note on the complexity of single-machi

A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs

✍ Jinjiang Yuan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 119 KB

Single machine batch scheduling with dea

Single machine batch scheduling with deadlines and resource dependent processing times

✍ T.C. Edwin Cheng; Mikhail Y. Kovalyov 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 519 KB

Single machine parallel batch scheduling

Single machine parallel batch scheduling subject to precedence constraints

✍ T.C.E. Cheng; C.T. Ng; J.J. Yuan; Z.H. Liu 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB

Scheduling a batching machine

✍ Peter Brucker; Andrei Gladky; Han Hoogeveen; Mikhail Y. Kovalyov; Chris N. Potts 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 185 KB

We address the problem of scheduling n jobs on a batching machine to minimize regular scheduling criteria that are non-decreasing in the job completion times. A batching machine is a machine that can handle up to b jobs simultaneously. The jobs that are processed together form a batch, and all jobs

Parallel machine batching and scheduling

Parallel machine batching and scheduling with deadlines

✍ T. C. Edwin Cheng; Mikhail Y. Kovalyov 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 137 KB 👁 1 views

In this paper, we study the problem of scheduling n independent jobs non-preemptively on m unrelated parallel machines. Each job j has a processing time and a deadline, the time at which the job must be completed. On each machine, jobs may be grouped to form batches containing continuously scheduled