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

Optimal scheduling for one machine with incomplete information

โœ Scribed by L. I. Feigin


Publisher
Springer US
Year
1974
Tongue
English
Weight
225 KB
Volume
7
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The optimal on-line parallel machine sch
โœ Yong He ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 271 KB

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.