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

Minimizing maximum tardiness for unrelated parallel machines

โœ Scribed by V. Suresh; Dipak Chaudhuri

Book ID
103961816
Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
542 KB
Volume
34
Category
Article
ISSN
0925-5273

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 using various combinations of processing times and due dates. The results show that the proposed algorithm meets the expectations of any scheduling environment.

๐Ÿ“œ SIMILAR VOLUMES

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