𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Tiny Time Machines Revisit Ancient Life

✍ Scribed by Gibbons, A.

Book ID
121312136
Publisher
American Association for the Advancement of Science
Year
2010
Tongue
English
Weight
281 KB
Volume
330
Category
Article
ISSN
0036-8075

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Revisiting ancient times
Revisiting ancient times
✍ Marc S Nelson πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 143 KB
Time complexity and linear-time approxim
Time complexity and linear-time approximation of the ancient two-machine flow shop
✍ GΓΌnter Rote; Gerhard J. Woeginger πŸ“‚ Article πŸ“… 1998 πŸ› Springer US 🌐 English βš– 87 KB πŸ‘ 3 views

We consider the scheduling problems F2 "" C and F2"no-wait"C , i.e. makespan minimization in a two-machine flow shop, with and without no wait in process. For both problems solution algorithms based on sorting with O(n log n) running time are known, where n denotes the number of jobs. [1,2]. We pro