𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Single machine scheduling with semi-resumable machine availability constraints

✍ Scribed by Yong Chen; An Zhang; Zhi-yi Tan

Book ID
107501014
Publisher
SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year
2011
Tongue
English
Weight
169 KB
Volume
26
Category
Article
ISSN
1005-1031

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Two-machine flowshop scheduling with ava
Two-machine flowshop scheduling with availability constraints
✍ Chung-Yee Lee πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 143 KB

The majority of the scheduling literature carries a common assumption that machines are available all the time. However, this availability assumption may not be true in real industry settings, since a machine may become unavailable during certain periods of time when, for instance, a machine breakdo

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