Filters








8,971 Hits in 3.6 sec

An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems

Martin W. P. Savelsbergh, R. N. Uma, Joel Wein
2005 INFORMS journal on computing  
Specifically, we give a comprehensive experimental study of a number of these approximation algorithms for 1 r j w j C j , the problem of scheduling jobs with release dates on one machine so as to minimize  ...  R ecently there has been much progress on the design of approximation algorithms for a variety of scheduling problems in which the goal is to minimize the average weighted completion time of the jobs scheduled  ...  Some of this work was done while the third author was visiting the IBM T. J. Watson Research Center.  ... 
doi:10.1287/ijoc.1030.0055 fatcat:duyan3aqebhifgrbs77nmonaeq

On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems [chapter]

R. N. Uma, Joel Wein
1998 Lecture Notes in Computer Science  
We observe that on most kinds of synthetic data used in experimental studies a simple heuristic, used in successful combinatorial branch-and-bound algorithms for the problem, outperforms on average all  ...  of the LP-based heuristics.  ...  Some of the results in Section 3 were independently obtained by David Williamson and a joint journal paper is forthcoming.  ... 
doi:10.1007/3-540-69346-7_30 fatcat:mf7ha72jkrfufegjkl6zrvk4qm

Data Collection with Multiple Sinks in Wireless Sensor Networks [chapter]

Sixia Chen, Matthew Coolbeth, Hieu Dinh, Yoo-Ah Kim, Bing Wang
2009 Lecture Notes in Computer Science  
We also present a heuristic algorithm based on breadth first search for this problem.  ...  We design an approximation algorithm to minimize the latency of data collection schedule and show that it gives a constant-factor performance guarantee.  ...  Theorem 3 . 3 The LP-based algorithm gives c-approximation for Multi-sink Data Collection problem.  ... 
doi:10.1007/978-3-642-03417-6_28 fatcat:7py4ukx5zvg47fozy7vdxwync4

Job Scheduling Using Successive Linear Programming Approximations of a Sparse Model [chapter]

Stephane Chretien, Jean-Marc Nicod, Laurent Philippe, Veronika Rehn-Sonigo, Lamiel Toch
2012 Lecture Notes in Computer Science  
We compare the scheduling approach with the classic Largest Task First list based algorithm and we show that our approach provides good results for small instances of the problem.  ...  We introduce a novel approach based on successive linear programming (LP) approximations of a sparse model.  ...  The contribution of this paper is a novel approach for scheduling a collection of rigid or moldable jobs using successive LP approximations based on the gradient operator.  ... 
doi:10.1007/978-3-642-32820-6_14 fatcat:lq4ev4yysvaczm7tu3dwfjzmmu

An Experimental Study of Algorithms for Weighted Completion Time Scheduling

I. D. Baev, W. M. Meleis, A. Eichenberger
2002 Algorithmica  
However, little is known about the experimental behavior of algorithms for the general problem.  ...  This important and broad class of problems is known to be NP-hard, even for restricted special cases, and the best known approximation algorithms have w orstcase performance that is far from optimal.  ...  The total computation time for the LP-based algorithms was an average of 2 minutes perinstance.  ... 
doi:10.1007/s00453-001-0103-x fatcat:5uky5q5mqfe3pk7cldr4u3ohr4

Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems

Fernando C. Gomes, Cláudio N. Meneses, Panos M. Pardalos, Gerardo Valdisio R. Viana
2006 Computers & Operations Research  
We conduct a controlled empirical study of approximation algorithms for the Vertex Cover and the Set Covering Problems. Many authors have proposed approximation algorithms for those problems.  ...  However, theoretical results may not reflect the experimental performance of the proposed algorithms.  ...  We now turn to an algorithm based on the dual program of the LP.  ... 
doi:10.1016/j.cor.2005.03.030 fatcat:ihma7yx6tvbylmeioqurxq7hhe

Experimental Analysis of Algorithms for Coflow Scheduling [article]

Zhen Qiu, Cliff Stein, Yuan Zhong
2016 arXiv   pre-print
In this paper, we carry out a comprehensive experimental analysis on a Facebook trace and extensive simulated instances to evaluate the practical performance of several algorithms for coflow scheduling  ...  In our previous paper, we considered the strongly NP-hard problem of minimizing the total weighted completion time of coflows with release dates, and developed the first polynomial-time scheduling algorithms  ...  Acknowledgment Yuan Zhong would like to thank Mosharaf Chowdhury and Ion Stoica for numerous discussions on the coflow scheduling problem, and for sharing the Facebook data.  ... 
arXiv:1603.07981v1 fatcat:bpqpjmfourcn3d7ndlqhpupcdy

On Constructing DAG-Schedules with Large AREAs [chapter]

Scott T. Roche, Arnold L. Rosenberg, Rajmohan Rajaraman
2014 Lecture Notes in Computer Science  
The "85%" result is obtained from formulating the Areamaximization problem as a Linear Program (LP); the Areas of DAG-schedules produced by the Sidney heuristic are at least 85% of the Area-value produced  ...  Our first result shows that the problem of crafting Area-maximal schedules for general DAGs is NP-complete, hence likely computationally intractable.  ...  The authors are grateful to the following for helpful conversations and valuable advice: Gennaro Cordasco, regarding experimental issues; Greg Malewicz, regarding the LP formulation of AREA-MAX; Michela  ... 
doi:10.1007/978-3-319-09873-9_52 fatcat:mfihst7ovvfuhfwskivi7ntmt4

On constructing DAG-schedules with large areas

Scott T. Roche, Arnold L. Rosenberg, Rajmohan Rajaraman
2015 Concurrency and Computation  
The "85%" result is obtained from formulating the Areamaximization problem as a Linear Program (LP); the Areas of DAG-schedules produced by the Sidney heuristic are at least 85% of the Area-value produced  ...  Our first result shows that the problem of crafting Area-maximal schedules for general DAGs is NP-complete, hence likely computationally intractable.  ...  The authors are grateful to the following for helpful conversations and valuable advice: Gennaro Cordasco, regarding experimental issues; Greg Malewicz, regarding the LP formulation of AREA-MAX; Michela  ... 
doi:10.1002/cpe.3560 fatcat:4zfo7mp6jjcjlcbwbqfc624rb4

Scheduling orders for multiple product types to minimize total weighted completion time

Joseph Y.-T. Leung, Haibing Li, Michael Pinedo
2007 Discrete Applied Mathematics  
We consider the problem of scheduling orders for multiple different product types in an environment with m dedicated machines in parallel.  ...  They include various static and dynamic priority rules as well as two more sophisticated LP-based algorithms.  ...  They also thank the anonymous referees for their comments which are valuable to improve the paper.  ... 
doi:10.1016/j.dam.2006.09.012 fatcat:cwih5b7udbcf5hpekfaek55drm

Improved performance control on the Grid

M.E. Tellier, G.D. Riley, T.L. Freeman
2009 Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences  
., a threshold-based performance control system (PerCo) was described and an initial experimental evaluation was presented.  ...  Furthermore, we find that the execution time of this optimal threshold-based schedule is very close (within 0.5%) to the execution time that results from a linear programming optimal schedule.  ...  The work of the first author has been supported by the award of an EPSRC Doctoral Training Studentship; the work of the second author has been supported by the BBSRC e-Science project: IntBioSim (BBS/B  ... 
doi:10.1098/rsta.2009.0029 pmid:19451108 fatcat:mlu65kqltze2zjfrq2qux6e3d4

Automated techniques for energy efficient scheduling on homogeneous and heterogeneous chip multi-processor architectures

Sushu Zhang, Karam S. Chatha
2008 2008 Asia and South Pacific Design Automation Conference  
We prove that the problem is strongly NP-hard. We propose polynomial time 2-approximation algorithms for homogeneous and heterogeneous CMPs.  ...  To the best of our knowledge, our techniques offer the tightest bounds for energy constrained design on CMP architectures.  ...  In this subsection, we propose a 2-approximation scheduling algorithm based on the algorithm for the generalized assignment problem (GAP) [18] .  ... 
doi:10.1109/aspdac.2008.4484026 dblp:conf/aspdac/ZhangC08 fatcat:v56s37yqkzfs3gxccjgjcwy2g4

Scheduling Flows on a Switch to Optimize Response Times [article]

Hamidreza Jahanjou and Rajmohan Rajaraman and David Stalfa
2020 arXiv   pre-print
We present approximation algorithms for flow scheduling over a switch to optimize response time based metrics.  ...  For the average response time metric, whose NP-hardness follows directly from past work, we present an offline O(1 + O(log(n))/c) approximation algorithm for unit flows, assuming that the port capacities  ...  We would like to thank Janardhan Kulkarni for the many discussions on online flow scheduling, and for generously allowing us to include his proof of Lemma 5.1.  ... 
arXiv:2005.09724v3 fatcat:gscakg6i7zcwddmphch3iz7c3y

Single Machine Scheduling with Release Dates

Michel X. Goemans, Maurice Queyranne, Andreas S. Schulz, Martin Skutella, Yaoguang Wang
2002 SIAM Journal on Discrete Mathematics  
We first study two linear programming relaxations of the problem, one based on a time-indexed formulation, the other on a completiontime formulation.  ...  Based on the greedy solution, we describe two simple randomized approximation algorithms, which are guaranteed to deliver feasible schedules with expected objective function value within factors of 1.7451  ...  The authors are grateful to an anonymous referee whose comments helped to improve the presentation of this paper.  ... 
doi:10.1137/s089548019936223x fatcat:s7js35jzbnewfol2ag37madb6e

Joint scheduling of processing and Shuffle phases in MapReduce systems

Fangfei Chen, Murali Kodialam, T. V. Lakshman
2012 2012 Proceedings IEEE INFOCOM  
We give guaranteed approximation algorithms and outline several heuristics to solve the joint scheduling problem.  ...  MapReduce has emerged as an important paradigm for processing data in large data centers. MapReduce is a three phase algorithm comprising of Map, Shuffle and Reduce phases.  ...  Kim [8] gave an LP-based 10-approximation for general processing times , which was then improved by Gandhi and Mestre [14] with a combinatorial algorithm. Hajiaghayi et al.  ... 
doi:10.1109/infcom.2012.6195473 dblp:conf/infocom/ChenKL12 fatcat:5jjlo6ndbfh3lhlsr3fzz2ve5m
« Previous Showing results 1 — 15 out of 8,971 results