Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
BETTER BOUNDS FOR ONLINE SCHEDULING SUSANNE ALBERSy Abstract. We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing
Add to Reading List
Document Date: 2013-11-25 11:06:19
Open Document
File Size: 231,00 KB
Share Result on Facebook
BETTER BOUNDS FOR ONLINE SCHEDULING SUSANNE ALBERSy Abstract. We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing