✦ LIBER ✦

Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time

✍ Scribed by Joseph Y.-T. Leung; Haibing Li; Michael Pinedo

Publisher: Springer US
Year: 2007
Tongue: English
Weight: 343 KB
Volume: 159
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-007-0270-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling on identical parallel machine

Scheduling on identical parallel machines to minimize total completion time with deadline and machine eligibility constraints

✍ Ling-Huey Su 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 193 KB

Approximation algorithms for minimizing

Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel

✍ Joseph Y-T. Leung; Haibing Li; Michael Pinedo 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB

## Abstract We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is re