1140 IEEE TRANSACTIONS ON COMPUTERS, VOL. 61,

First Page		Document Content
Date: 2012-11-23 03:30:28 Embedded systems Scheduling Technology Worst-case execution time Job shop scheduling Thorn Computing Scheduling algorithms Operations research Real-time computing		1140 IEEE TRANSACTIONS ON COMPUTERS, VOL. 61, Add to Reading List Source URL: www.coga.tu-berlin.de Download Document from Source Website File Size: 300,81 KB Share Document on Facebook

	Hardness of Approximating Flow and Job Shop Scheduling Problems MONALDO MASTROLILLI, IDSIA, Lugano, Switzerland OLA SVENSSON, EPFL, Switzerland 20 We consider several variants of the job shop problem that is a fundamenta DocID: 1uCRt - View Document
	Radboud Universiteit Nijmegen Master Thesis Mathematics Scheduling with job dependent machine speed DocID: 1rrDA - View Document
	Microsoft Word - IBSAlgorithms.doc DocID: 1rkGY - View Document
	239 Documenta Math. Ronald Graham: Laying the Foundations of Online Optimization DocID: 1r1tq - View Document
	Minimizing maximum (weighted) flow-time on related and unrelated machines S. Anand1 Karl Bringmann2 Tobias Friedrich3 Naveen Garg1 Amit Kumar1 1 DocID: 1qWKb - View Document