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

An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs

โœ Scribed by Li, Kenli; Liu, Chubo; Li, Keqin

Book ID
124133089
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
456 KB
Volume
543
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Scheduling resumable simple linear deter
Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan
โœ Min Ji; T.C.E. Cheng ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 194 KB

## a b s t r a c t We consider a single-machine scheduling problem in which the processing time of each job is a simple linear deteriorating function of its waiting time. The machine is subject to an availability constraint. Jobs interrupted by machine unavailability can resume their processing. Th