File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.4230/LIPIcs.APPROX-RANDOM.2018.14
- Scopus: eid_2-s2.0-85052456074
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Online Makespan Minimization: The Power of Restart
Title | Online Makespan Minimization: The Power of Restart |
---|---|
Authors | |
Keywords | Online Scheduling Makespan Minimization Identical Machines |
Issue Date | 2018 |
Publisher | Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl Publishing. |
Citation | 21st International Workshop, APPROX 2018, and 22nd International Workshop, RANDOM 2018, Princeton, USA, 20-22 August 2018. In Blais, E ... et al (eds.), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018), abstract no. 14:1-19 How to Cite? |
Abstract | We consider the online makespan minimization problem on identical machines. Chen and Vestjens (ORL 1997) show that the largest processing time first (LPT) algorithm is 1.5-competitive. For the special case of two machines, Noga and Seiden (TCS 2001) introduce the SLEEPY algorithm that achieves a competitive ratio of (5−5 – √ )/2≈1.382 , matching the lower bound by Chen and Vestjens (ORL 1997). Furthermore, Noga and Seiden note that in many applications one can kill a job and restart it later, and they leave an open problem whether algorithms with restart can obtain better competitive ratios.
We resolve this long-standing open problem on the positive end. Our algorithm has a natural rule for killing a processing job: a newly-arrived job replaces the smallest processing job if 1) the new job is larger than other pending jobs, 2) the new job is much larger than the processing one, and 3) the processed portion is small relative to the size of the new job. With appropriate choice of parameters, we show that our algorithm improves the 1.5 competitive ratio for the general case, and the 1.382 competitive ratio for the two-machine case. |
Description | The 21st International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'2018), and the 22nd International Conference on Randomization and Computation (RANDOM'2018) |
Persistent Identifier | http://hdl.handle.net/10722/260347 |
ISBN | |
Series/Report no. | Leibniz International Proceedings in Informatics (LIPIcs) ; v. 116 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Huang, Z | - |
dc.contributor.author | Kang, N | - |
dc.contributor.author | Tang, Z | - |
dc.contributor.author | Wu, X | - |
dc.contributor.author | Zhang, Y | - |
dc.date.accessioned | 2018-09-14T08:40:11Z | - |
dc.date.available | 2018-09-14T08:40:11Z | - |
dc.date.issued | 2018 | - |
dc.identifier.citation | 21st International Workshop, APPROX 2018, and 22nd International Workshop, RANDOM 2018, Princeton, USA, 20-22 August 2018. In Blais, E ... et al (eds.), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018), abstract no. 14:1-19 | - |
dc.identifier.isbn | 978-3-95977-085-9 | - |
dc.identifier.uri | http://hdl.handle.net/10722/260347 | - |
dc.description | The 21st International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'2018), and the 22nd International Conference on Randomization and Computation (RANDOM'2018) | - |
dc.description.abstract | We consider the online makespan minimization problem on identical machines. Chen and Vestjens (ORL 1997) show that the largest processing time first (LPT) algorithm is 1.5-competitive. For the special case of two machines, Noga and Seiden (TCS 2001) introduce the SLEEPY algorithm that achieves a competitive ratio of (5−5 – √ )/2≈1.382 , matching the lower bound by Chen and Vestjens (ORL 1997). Furthermore, Noga and Seiden note that in many applications one can kill a job and restart it later, and they leave an open problem whether algorithms with restart can obtain better competitive ratios. We resolve this long-standing open problem on the positive end. Our algorithm has a natural rule for killing a processing job: a newly-arrived job replaces the smallest processing job if 1) the new job is larger than other pending jobs, 2) the new job is much larger than the processing one, and 3) the processed portion is small relative to the size of the new job. With appropriate choice of parameters, we show that our algorithm improves the 1.5 competitive ratio for the general case, and the 1.382 competitive ratio for the two-machine case. | - |
dc.language | eng | - |
dc.publisher | Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl Publishing. | - |
dc.relation.ispartof | Proceedings of the 21st International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX/RANDOM 2018) | - |
dc.relation.ispartofseries | Leibniz International Proceedings in Informatics (LIPIcs) ; v. 116 | - |
dc.subject | Online Scheduling | - |
dc.subject | Makespan Minimization | - |
dc.subject | Identical Machines | - |
dc.title | Online Makespan Minimization: The Power of Restart | - |
dc.type | Conference_Paper | - |
dc.identifier.email | Huang, Z: zhiyi@cs.hku.hk | - |
dc.identifier.authority | Huang, Z=rp01804 | - |
dc.identifier.doi | 10.4230/LIPIcs.APPROX-RANDOM.2018.14 | - |
dc.identifier.scopus | eid_2-s2.0-85052456074 | - |
dc.identifier.hkuros | 290751 | - |
dc.identifier.spage | 14:1 | - |
dc.identifier.epage | 14:19 | - |
dc.publisher.place | Dagstuhl, Germany | - |