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

Approximation algorithms for problems in scheduling with set-ups

โœ Scribed by Srikrishnan Divakaran; Michael Saks

Book ID
108112698
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
146 KB
Volume
156
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Approximation Algorithms for Scheduling
Approximation Algorithms for Scheduling with
โœ Florian Diedrich; Klaus Jansen; Fanny Pascual; Denis Trystram ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Springer ๐ŸŒ English โš– 474 KB
Approximation algorithms for shop schedu
Approximation algorithms for shop scheduling problems with minsum objective
โœ Maurice Queyranne; Maxim Sviridenko ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Springer US ๐ŸŒ English โš– 166 KB

We consider a general class of multiprocessor shop scheduling problems, preemptive or non-preemptive, with precedence constraints between operations, with job or operation release dates, and with a class of objective functions including weighted sums of job, operations and stage completion times. We