𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimizing total weighted flowtime subject to minimum makespan on two identical parallel machines

✍ Scribed by Johnny C. Ho; Francisco J. López; Alex J. Ruiz-Torres; Tzu-Liang (Bill) Tseng

Publisher
Springer US
Year
2009
Tongue
English
Weight
398 KB
Volume
22
Category
Article
ISSN
0956-5515

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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