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

On States of Total Weighted Occupation Times for Superdiffusions

โœ Scribed by Yan Xia Ren

Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2002
Tongue
English
Weight
172 KB
Volume
18
Category
Article
ISSN
1439-7617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Quality of move-optimal schedules for mi
Quality of move-optimal schedules for minimizing total weighted completion time
โœ 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

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