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

The optimal on-line parallel machine scheduling

โœ Scribed by Yong He

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
271 KB
Volume
39
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

โœฆ Synopsis

This paper investigates on-line parallel machine scheduling problems. We show the optimality of the classical LS algorithm. (~) 2000 Elsevier Science Ltd. All rights reserved.

๐Ÿ“œ SIMILAR VOLUMES

Optimization of job scheduling on parall
Optimization of job scheduling on parallel machines by simulated annealing algorithms
โœ Zhen-Ping Lo; B. Bavarian ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 536 KB

ln this paper, we consider the problem of scheduling a set of simultaneously available jobs on several parallel machines. Specifically, the minimization of the time to finish all the jobs assigned to all machines under job deadline constraints for n jobs, m machines problem is formulated in this pap

Approximation schemes for scheduling on
Approximation schemes for scheduling on parallel machines
โœ Noga Alon; Yossi Azar; Gerhard J. Woeginger; Tal Yadid ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Springer US ๐ŸŒ English โš– 124 KB ๐Ÿ‘ 1 views

We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depend on the machine completion times. As a main result, we identify some conditions on the objective function, under which

Randomized On-line Scheduling of Paralle
Randomized On-line Scheduling of Parallel Jobs
โœ Jiล™ฤฑ́ Sgall ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 230 KB

We study randomized on-line scheduling on mesh machines. We show that for scheduling independent jobs randomized algorithms can achieve a significantly better performance than deterministic ones; on the other hand with dependencies randomization does not help.