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

Scheduling of a single machine to minimize total weighted completion time subject to release dates

โœ Scribed by Lucio Bianco; Salvatore Ricciardelli

Publisher
John Wiley and Sons
Year
1982
Tongue
English
Weight
764 KB
Volume
29
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

โœฆ Synopsis

Abstract

In this paper the n/1/r~j~ ฮฃ~j~ w~j~ C~j~ problem under the assumptions of nonpreemptive sequencing and sequence independent processing times is investigated. After pointing out the fundamental properties, some dominance sufficient conditions among sequences are obtained and a branch and bound algorithm is proposed. Computational results are reported and discussed.

๐Ÿ“œ SIMILAR VOLUMES

Scheduling with tool changes to minimize
Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance
โœ M. Selim Akturk; Jay B. Ghosh; Evrim D. Gunes ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 114 KB

## Abstract The machine scheduling literature does not consider the issue of tool change. The parallel literature on tool management addresses this issue but assumes that the change is due only to part mix. In practice, however, a tool change is caused most frequently by tool wear. That is why we c

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