Show simple item record

dc.contributor.authorNguyen Kim, Thang
dc.date.accessioned2013-10-15T14:15:52Z
dc.date.available2013-10-15T14:15:52Z
dc.date.issued2011
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/11832
dc.language.isoenen
dc.subjectpreemptionen
dc.subjectscheduling problemen
dc.subject.ddc4en
dc.titleImproved Online Scheduling in Maximizing Throughput of Equal Length Jobsen
dc.typeCommunication / Conférence
dc.description.abstractenMotivated by issues raised from data broadcast and networks using ATM and TCP/IP, we consider an online scheduling problem on a single machine. In the problem, each job i is revealed at release time r i , has processing time p i , deadline d i and weight w i . Preemption is allowed and there are two models of preemption: preemption with restart and preemption with resume. The goal is to maximize the throughput — the total weight of all jobs completed on time. In the paper, we consider the problem where all processing time of jobs are equal and present improved algorithms which achieve 4.24-competitive in both models of preemption.en
dc.identifier.citationpages429-442en
dc.relation.ispartofseriestitleLecture Notes in Computer Scienceen
dc.relation.ispartofseriesnumber6651en
dc.relation.ispartoftitleComputer Science – Theory and Applications 6th International Computer Science Symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14-18, 2011. Proceedingsen
dc.relation.ispartofeditorKulikov, Alexander
dc.relation.ispartofeditorVereshchagin, Nikolay
dc.relation.ispartofpublnameSpringeren
dc.relation.ispartofpublcityBerlinen
dc.relation.ispartofdate2011
dc.relation.ispartofpages471en
dc.relation.ispartofurlhttp://dx.doi.org/10.1007/978-3-642-20712-9en
dc.subject.ddclabelInformatique généraleen
dc.relation.ispartofisbn978-3-642-20711-2en
dc.relation.conftitle6th International Computer Science Symposium in Russia, CSR 2011en
dc.relation.confdate2011-06
dc.relation.confcitySt Petersbourgen
dc.relation.confcountryRussieen
dc.relation.forthcomingnonen
dc.identifier.doihttp://dx.doi.org/10.1007/978-3-642-20712-9_34en


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record