Optimal preemptive scheduling on uniform machines with discounted flowtime objectives

dc.creator	Pandelis, D. G.	en
dc.date.accessioned	2015-11-23T10:42:15Z
dc.date.available	2015-11-23T10:42:15Z
dc.date.issued	2007
dc.identifier	10.1016/j.ejor.2005.09.039
dc.identifier.issn	0377-2217
dc.identifier.uri	http://hdl.handle.net/11615/31564
dc.description.abstract	We consider the problem of scheduling n jobs on m parallel machines. Each job has a deterministic processing time and a weight associated with it. For uniform machines we show that discounted flowtime is minimized by serving jobs preemptively in increasing order of their remaining processing times, assigning the job with the shortest remaining processing time to the fastest available machine. (c) 2006 Published by Elsevier B.V.	en
dc.source	European Journal of Operational Research	en
dc.source.uri	<Go to ISI>://WOS:000242301100042
dc.subject	scheduling	en
dc.subject	uniform machines	en
dc.subject	discounted flowtime	en
dc.subject	Management	en
dc.subject	Operations Research & Management Science	en
dc.title	Optimal preemptive scheduling on uniform machines with discounted flowtime objectives	en
dc.type	journalArticle	en

Αρχεία σε αυτό το τεκμήριο

Αρχεία	Μέγεθος	Τύπος	Προβολή
Δεν υπάρχουν αρχεία που να σχετίζονται με αυτό το τεκμήριο.