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

Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine

โœ Scribed by Chin-Chia Wu; Wen-Chiung Lee

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
74 KB
Volume
87
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 of the availability to a facility, the linear deteriorating model can be solved using the 0-1 integer programming technique if the actual job processing time is proportional to the starting time.

๐Ÿ“œ 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

Scheduling jobs with random processing t
Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties
โœ X. Cai; F. S. Tu ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 942 KB

We examine the problem of scheduling n jobs with a common due date on a single machine. The processing time ofeach job is a random variable, which follows an arbitrary distribution with a known mean and a known variance. The machine is not reliable; it is subject to stochastic breakdowns. The objec