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

Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time

โœ Scribed by C. T. Ng; T. C. Edwin Cheng; Adam Janiak; Mikhail Y. Kovalyov


Publisher
Springer US
Year
2005
Tongue
English
Weight
135 KB
Volume
133
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Quality of move-optimal schedules for mi
โœ Tobias Brueggemann; Johann L. Hurink; Walter Kern ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 184 KB

We study the minimum total weighted completion time problem on identical machines. We analyze a simple local search heuristic, moving jobs from one machine to another. The local optima can be shown to be approximately optimal with approximation ratio 3 2 . In a special case, the approximation ratio