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

First Page		Document Content
Date: 2013-11-25 11:06:19		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 Source URL: www14.in.tum.de Download Document from Source Website File Size: 231,00 KB Share Document on Facebook