𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimizing Makespan in Semiresumable Case of Single-Machine Scheduling with an Availability Constraint

✍ Scribed by Ma Ying; Yang Shan-lin; Chu Cheng-bin

Publisher
Elsevier
Year
2009
Weight
198 KB
Volume
29
Category
Article
ISSN
1874-8651

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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