๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Minimizing total weighted completion time approximately for the parallel machine problem with a single server

โœ Scribed by Hasani, Keramat; Kravchenko, Svetlana A.; Werner, Frank

Book ID
122274443
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
193 KB
Volume
114
Category
Article
ISSN
0020-0190

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