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

An approximation algorithm for identical parallel machine scheduling with resource dependent processing times

โœ Scribed by Hans Kellerer

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
119 KB
Volume
36
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Single-machine scheduling with learning
Single-machine scheduling with learning effect and resource-dependent processing times
โœ Dan Wang; Ming-Zheng Wang; Ji-Bo Wang ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 206 KB

We consider resource allocation scheduling with learning effect in which the processing time of a job is a function of its position in a sequence and its resource allocation. The objective is to find the optimal sequence of jobs and the optimal resource allocation separately. We concentrate on two g

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