✦ LIBER ✦

Minimizing total weighted tardiness on a batch-processing machine with non-agreeable release times and due dates

✍ Scribed by Muthu Mathirajan; V. Bhargav; V. Ramachandran

Publisher: Springer
Year: 2009
Tongue: English
Weight: 373 KB
Volume: 48
Category: Article
ISSN: 0268-3768
DOI: 10.1007/s00170-009-2342-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling with agreeable release times

Scheduling with agreeable release times and due dates on a batch processing machine

✍ Chung-Lun Li; Chung-Yee Lee 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 431 KB

Minimization of total tardiness on unrel

Minimization of total tardiness on unrelated parallel machines with sequence- and machine-dependent setup times under due date constraints

✍ Shih-Wei Lin; Chung-Cheng Lu; Kuo-Ching Ying 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 267 KB

Minimizing makespan on a single batching

Minimizing makespan on a single batching machine with release times and non-identical job sizes

✍ Shuguang Li; Guojun Li; Xiaoli Wang; Qiming Liu 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 214 KB

We consider the problem of scheduling jobs with release times and non-identical job sizes on a single batching machine; our objective is to minimize makespan. We present an approximation algorithm with worst-case ratio 2 + , where ¿ 0 can be made arbitrarily small.

Fast approximation algorithms to minimiz

Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates

✍ Imed Kacem; Hans Kellerer 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 565 KB