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

Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan

โœ Scribed by Xiuli Wang; T.C. Edwin Cheng

Book ID
108118099
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
226 KB
Volume
178
Category
Article
ISSN
0377-2217

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

Single-machine group scheduling with bot
Single-machine group scheduling with both learning effects and deteriorating jobs
โœ Xue Huang; Ming-Zheng Wang; Ji-Bo Wang ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 205 KB

In the paper two resource constrained single-machine group scheduling problems with both learning effects and deteriorating jobs are considered. By learning effects, deteriorating jobs and group technology assumption, we mean that the processing time of a job is defined by the function of its starti