Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Online algorithms with advice: A survey
J Boyar, LM Favrholdt, C Kudahl, KS Larsen… - ACM Computing …, 2017 - dl.acm.org
In online scenarios requests arrive over time, and each request must be serviced in an
irrevocable manner before the next request arrives. Online algorithms with advice is an area …
irrevocable manner before the next request arrives. Online algorithms with advice is an area …
[كتاب][B] Scheduling
ML Pinedo - 2012 - Springer
Michael L. Pinedo Theory, Algorithms, and Systems Sixth Edition Page 1 Scheduling Michael L.
Pinedo Theory, Algorithms, and Systems Sixth Edition Page 2 Scheduling Page 3 Michael L …
Pinedo Theory, Algorithms, and Systems Sixth Edition Page 2 Scheduling Page 3 Michael L …
Online algorithms: a survey
S Albers - Mathematical Programming, 2003 - Springer
During the last 15 years online algorithms have received considerable research interest. In
this survey we give an introduction to the competitive analysis of online algorithms and …
this survey we give an introduction to the competitive analysis of online algorithms and …
[PDF][PDF] Online scheduling.
In this chapter, we summarize research e orts on several di erent problems that fall under the
rubric of online scheduling. In online scheduling, the scheduler receives jobs that arrive over …
rubric of online scheduling. In online scheduling, the scheduler receives jobs that arrive over …
Semi-online scheduling: A survey
In real-life applications, neither all the inputs of an algorithm are available at the outset, as in
an offline framework, nor do they occur one by one in order, as in an online setup. Semi …
an offline framework, nor do they occur one by one in order, as in an online setup. Semi …
Online scheduling with bounded migration
P Sanders, N Sivadasan… - … of Operations Research, 2009 - pubsonline.informs.org
Consider the classical online scheduling problem, in which jobs that arrive one by one are
assigned to identical parallel machines with the objective of minimizing the makespan. We …
assigned to identical parallel machines with the objective of minimizing the makespan. We …
Scheduling parallel jobs to minimize the makespan
B Johannes - Journal of Scheduling, 2006 - Springer
We consider the NP-hard problem of scheduling parallel jobs with release dates on identical
parallel machines to minimize the makespan. A parallel job requires simultaneously a …
parallel machines to minimize the makespan. A parallel job requires simultaneously a …
Online algorithms with advice: A survey
J Boyar, LM Favrholdt, C Kudahl, KS Larsen… - Acm Sigact News, 2016 - dl.acm.org
Online algorithms with advice is an area of research where one attempts to measure how
much knowledge of the future is necessary to achieve a given competitive ratio. The lower …
much knowledge of the future is necessary to achieve a given competitive ratio. The lower …
Semi-online scheduling revisited
S Albers, M Hellwig - Theoretical Computer Science, 2012 - Elsevier
Makespan minimization on m identical machines is a fundamental scheduling problem. The
goal is to assign a sequence of jobs, each specified by a processing time, to parallel …
goal is to assign a sequence of jobs, each specified by a processing time, to parallel …
Robust polynomial-time approximation schemes for parallel machine scheduling with job arrivals and departures
M Skutella, J Verschae - Mathematics of Operations …, 2016 - pubsonline.informs.org
Scheduling a set of n jobs on m identical parallel machines so as to minimize the makespan
or maximize the minimum machine load are two of the most important and fundamental …
or maximize the minimum machine load are two of the most important and fundamental …