𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Byzantine-Resistant Total Ordering Algorithms

✍ Scribed by Louise E. Moser; P.M. Melliar-Smith


Book ID
112252405
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
329 KB
Volume
150
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Approximation algorithms for minimizing
✍ Joseph Y-T. Leung; Haibing Li; Michael Pinedo πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 214 KB

## Abstract We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is re