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

Minimizing total tardiness on parallel machines with preemptions

โœ Scribed by Svetlana A. Kravchenko; Frank Werner

Book ID
113072516
Publisher
Springer US
Year
2010
Tongue
English
Weight
398 KB
Volume
15
Category
Article
ISSN
1094-6136

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Minimizing maximum tardiness for unrelat
Minimizing maximum tardiness for unrelated parallel machines
โœ V. Suresh; Dipak Chaudhuri ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 542 KB

In this paper, the scheduling of n jobs, all requiring a single stage of processing, on m unrelated parallel machines is considered. The scheduling objective is to minimize the maximum tradiness. An algorithm is proposed for the above problem. Computational results are reported with data generated u

Heuristics for minimizing mean tardiness
Heuristics for minimizing mean tardiness for m parallel machines
โœ Johnny C. Ho; Yih-Long Chang ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 791 KB

The concept of parallel operations has been widely used in manufacturing and data processing. However, not many efficient methods have been proposed to reduce job tardiness. This article proposes an efficient heuristic to minimize the mean tardiness of a set of tasks with known processing times and