AboutPartnersSign inJoin
An almost-optimal algorithm for the assembly line scheduling problem

An almost-optimal algorithm for the assembly line scheduling problem

Stanford University. Computer Science Department, M. T. Kaufman — 1973
The paper considers a solution to the multiprocessor scheduling problem for the case where the ordering relation between tasks can be represented as a tree. (Modified author abstract).
Sign up to use

This book appears on the shelf Star trek

Photo of Andrea Mack
Andrea Mack@wisdomcheck
They Called Us Enemy
They Called Us Enemy by Steven Scott
Star Trek: Voyager: Atonement
Star Trek: Voyager: Atonement by Kirsten Beyer
Star Trek: Voyager: The Eternal Tide
Star Trek: Voyager: The Eternal Tide by Kirsten Beyer
A Pocket Full of Lies
A Pocket Full of Lies by Kirsten Beyer
The Star Trek: Enterprise: The Expanse
The Star Trek: Enterprise: The Expanse by J.M. Dillard
The Fall: Revelation and Dust
The Fall: Revelation and Dust by David R. George III