2006
DOI: 10.1007/11671411_9
|View full text |Cite
|
Sign up to set email alerts
|

A Note on Semi-online Machine Covering

Abstract: Abstract. In the machine cover problem we are given m machines and n jobs to be assigned (scheduled) so that the smallest load of a machine is as large as possible. A semi-online algorithm is given in advance the optimal value of the smallest load for the given instance, and then the jobs are scheduled one by one as they arrive, without any knowledge of the following jobs. We present a deterministic algorithm with competitive ratio 11/6 ≤ 1.834 for machine covering with any number of machines and a lower bound… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
11
0

Year Published

2009
2009
2022
2022

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 12 publications
(11 citation statements)
references
References 8 publications
0
11
0
Order By: Relevance
“…Further publications are concerned with a polynomial-time approximation scheme (PTAS) (cf. Woeginger 1997) and on-line as well as semi-on-line versions of P||C min (cf., e.g., Azar and Epstein 1998;He and Tan 2002;Luo and Sun 2005;Ebenlendr et al 2006;Cai 2007;Tan and Wu 2007;Epstein et al 2011). The sole publication devoted to exact solution procedures is due to Haouari and Jemmali (2008).…”
Section: Introductionmentioning
confidence: 98%
“…Further publications are concerned with a polynomial-time approximation scheme (PTAS) (cf. Woeginger 1997) and on-line as well as semi-on-line versions of P||C min (cf., e.g., Azar and Epstein 1998;He and Tan 2002;Luo and Sun 2005;Ebenlendr et al 2006;Cai 2007;Tan and Wu 2007;Epstein et al 2011). The sole publication devoted to exact solution procedures is due to Haouari and Jemmali (2008).…”
Section: Introductionmentioning
confidence: 98%
“…The non-selfish version of the problem has been well studied (known by different names such as ''machine covering'' and ''Santa Claus problem'') in the computer science literature (see e.g. [6,3,9]). Various gametheoretic aspects of max-min fairness in resource allocation games were considered before this paper (e.g.…”
Section: Introductionmentioning
confidence: 99%
“…[4,2,6,8]). Various game-theoretic aspects of max-min fairness in resource allocation games were considered, but unlike the makespan minimization problem for which the poa and the pos were extensively studied (see [17,3,18]), these measures were not previously considered for the uncoordinated machine covering problem in the setting of selfish jobs and uniformly related machines.…”
Section: Introductionmentioning
confidence: 99%