Results 1 - 10 of 402

Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing

by Haluk Topcuoglu, Min-you Wu, et al. - IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS , 2002
"... Efficient application scheduling is critical for achieving high performance in heterogeneous computing environments. The application scheduling problem has been shown to be NP-complete in general cases as well as in several restricted cases. Because of its key importance, this problem has been exte ..."
Abstract - Cited by 255 (0 self) - Add to MetaCart
the summation of upward and downward rank values for prioritizing tasks. Another difference is in the processor selection phase, which schedules the critical tasks onto the processor that minimizes the total execution time of the critical tasks. In order to provide a robust and unbiased comparison

Truthful Mechanisms for One-Parameter Agents

by Aron Archer, Eva Tardos
"... In this paper, we show how to design truthful (dominant strategy) mechanisms for several combinatorial problems where each agent’s secret data is naturally expressed by a single positive real number. The goal of the mechanisms we consider is to allocate loads placed on the agents, and an agent’s sec ..."
Abstract - Cited by 232 (3 self) - Add to MetaCart
truthful mechanisms for maximum flow, Qjj P Cj (scheduling related machines to minimize the sum of completion times), optimizing an affine function over a fixed set, and special cases of uncapacitated facility location. In addition, for Qjj P wjCj (minimizing the weighted sum of completion times), we prove

Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds

by Andreas S. Schulz
"... There has been recent success in using polyhedral formulations of scheduling problems not only to obtain good lower bounds in practice but also to develop provably good approximation algorithms. Most of these formulations rely on binary decision variables that are a kind of assignment variables. We ..."
Abstract - Cited by 52 (9 self) - Add to MetaCart
. We present quite simple polynomialtime approximation algorithms that are based on linear programming formulations with completion time variables and give the best known performance guarantees for minimizing the total weighted completion time in several scheduling environments. This amplifies

Dual constrained single machine sequencing to minimize total weighted completion time

by Yunpeng Pan , Member, IEEE Leyuan Shi - IEEE Transactions on Automation Science and Engineering , 2005
"... Abstract-We study a single-machine sequencing problem with both release dates and deadlines to minimize the total weighted completion time. We propose a branch-and-bound algorithm for this problem. The algorithm exploits an effective lower bound and a dynamic programming dominance technique. As a b ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
Abstract-We study a single-machine sequencing problem with both release dates and deadlines to minimize the total weighted completion time. We propose a branch-and-bound algorithm for this problem. The algorithm exploits an effective lower bound and a dynamic programming dominance technique. As a

Approximation Techniques for Average Completion Time Scheduling

by C. Chekuri, R. Motwani, B. Natarajan, C. Stein , 1997
"... We consider the problem of non-preemptive scheduling to minimize average (weighted) completion time, allowing for release dates, parallel machines, and precedence constraints. Recent work has led to constant-factor approximations for this problem, based on solving a preemptive or linear programming ..."
Abstract - Cited by 90 (7 self) - Add to MetaCart
We consider the problem of non-preemptive scheduling to minimize average (weighted) completion time, allowing for release dates, parallel machines, and precedence constraints. Recent work has led to constant-factor approximations for this problem, based on solving a preemptive or linear programming

Datacenter Net Profit Optimization with Deadline Dependent Pricing

by Wei Wang, Peng Zhang, Tian Lan, Vaneet Aggarwal
"... Abstract—This paper considers deadline dependent pricing and its impact to datacenter net profit optimization. We formulate the problem by jointly maximizing total revenue as a function of individual job deadlines and minimizing electricity cost through job scheduling over different time and locatio ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract—This paper considers deadline dependent pricing and its impact to datacenter net profit optimization. We formulate the problem by jointly maximizing total revenue as a function of individual job deadlines and minimizing electricity cost through job scheduling over different time

A Stability Approach for Minimizing Total Weighted Completion Time with Uncertain Data 1

by Yuri N. Sotskov, Natalja G. Egorova, Frank Werner , 2010
"... Abstract–A single-machine scheduling problem is investigated provided that the input data are uncertain: The processing time of a job can take any real value from the given segment. The criterion is to minimize the total weighted completion time for the n jobs. As a solution concept to such a schedu ..."
Abstract - Add to MetaCart
Abstract–A single-machine scheduling problem is investigated provided that the input data are uncertain: The processing time of a job can take any real value from the given segment. The criterion is to minimize the total weighted completion time for the n jobs. As a solution concept to such a

Scheduling Multiple Families of Jobs on Parallel Machines to Minimize Total Weighted Completion Time

by Zhi-Long Chen, Warren B. Powell , 2000
"... We consider the problem of scheduling multiple families of jobs on identical parallel machines to minimize the total weighted completion time of the jobs. In this problem# a setup time is necessary whenever a job from one family is processed immediately after another job from a di#erent family. The ..."
Abstract - Add to MetaCart
We consider the problem of scheduling multiple families of jobs on identical parallel machines to minimize the total weighted completion time of the jobs. In this problem# a setup time is necessary whenever a job from one family is processed immediately after another job from a di#erent family

Scheduling for speed bounded processors

by Nikhil Bansal, Ho-leung Chan, Tak-wah Lam, Lap-kei Lee - In Proc. ICALP , 2008
"... Abstract. We consider online scheduling algorithms in the dynamic speed scaling model, where a processor can scale its speed between 0 and some maximum speed T. The processor uses energy at rate s α when run at speed s, where α> 1 is a constant. Most modern processors use dynamic speed scaling to ..."
Abstract - Cited by 39 (12 self) - Add to MetaCart
total flow time plus energy for unweighted unit size jobs, and a (2 + o(1))α / ln α-competitive algorithm to minimize fractional weighted flow time plus energy. Prior to our work, these guarantees were known only when the processor speed was unbounded (T = ∞) [4]. 1

Improved scheduling algorithms for minsum criteria

by Soumen Chakrabarti, Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Cliff Stein, Joel Wein - Automata, Languages and Programming, volume 1099 of Lecture Notes in Computer Science , 1996
"... Abstract. We consider the problem of finding near-optimal solutions for a variety of A/I)-hard scheduling problems for which the objective is to minimize the total weighted completion time. Recent work has led to the development of several techniques that yield constant worst-case bounds in a number ..."
Abstract - Cited by 64 (18 self) - Add to MetaCart
performance guarantee for minimizing the total weighted completion time subject to release dates on a single machine, and subject to release dates and/or precedence constraints on identical parallel machines. We also give improved bounds on the power of preemption in scheduling jobs with release dates
Results 1 - 10 of 402