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

Scheduling jobs with equal processing times subject to machine eligibility constraints

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

Publisher
Springer US
Year
2010
Tongue
English
Weight
400 KB
Volume
14
Category
Article
ISSN
1094-6136

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Uniform machine scheduling of unit-time
Uniform machine scheduling of unit-time jobs subject to resource constraints
โœ Mikhail Y. Kovalyov; Yakov M. Shafransky ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 350 KB

The problem of scheduling a set of unit-time jobs on M uniform machines is studied. Some jobs may require a unit of an additional single resource during their execution. The resource is renewable but the total resource consumption is limited by the same value at each time instant. The objective is t

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