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

A note on scheduling parallel machines subject to breakdown and repair

โœ Scribed by Joseph Y.-T. Leung; Michael Pinedo


Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
127 KB
Volume
51
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

โœฆ Synopsis


Abstract

In this paper we consider n jobs and a number of machines in parallel. The machines are identical and subject to breakdown and repair. The number may therefore vary over time and is at time t equal to m(t). Preemptions are allowed. We consider three objectives, namely, the total completion time, โˆ‘ C~j~, the makespan C~max~, and the maximum lateness L~max~. We study the conditions on m(t) under which various rules minimize the objective functions under consideration. We analyze cases when the jobs have deadlines to meet and when the jobs are subject to precedence constraints. ยฉ 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.


๐Ÿ“œ SIMILAR VOLUMES


Scheduling a maintenance activity on par
โœ Asaf Levin; Gur Mosheiov; Assaf Sarig ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 113 KB

## Abstract We study a problem of scheduling a maintenance activity on parallel identical machines, under the assumption that all the machines must be maintained simultaneously. One example for this setting is a situation where the entire system must be stopped for maintenance because of a required

Scheduling jobs with random processing t
โœ 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