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

Scheduling deteriorating jobs to minimize the makespan on a single machine

โœ Scribed by Chin-Chia Wu; Yau-Ren Shiau; Ling-Huei Lee; Wen-Chiung Lee

Publisher
Springer
Year
2009
Tongue
English
Weight
153 KB
Volume
44
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Scheduling deteriorating jobs to minimiz
Scheduling deteriorating jobs to minimize makespan
โœ Wieslaw Kubiak; Steef van de Velde ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 83 KB

We consider a single-machine problem of scheduling n independent jobs to minimize makespan, in which the processing time of job J j grows by w j with each time unit its start is delayed beyond a given common critical date d. This processing time is p j if J j starts by d. We show that this problem i

Scheduling linear deteriorating jobs to
Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
โœ Chin-Chia Wu; Wen-Chiung Lee ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 74 KB

The scheduling problem with deteriorating jobs to minimize the makespan on a single machine where the facility has an availability constraint is studied in this paper. By a deteriorating job we mean that the processing time for the job is a function of its starting time. Even with the introduction o

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