Filters








502 Hits in 5.4 sec

Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines [article]

Giorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang, Abhinav Srivastav, Denis Trystram
2018 arXiv   pre-print
In this paper, we consider the online problem of scheduling independent jobs non-preemptively so as to minimize the weighted flow-time on a set of unrelated machines.  ...  In the non-preemptive setting, Lucarelli et al. showed that there exists a strong lower bound for minimizing weighted flow-time even on a single machine.  ...  For the online non-preemptive problem of minimizing the total weighted flow-time, Chekuri et al.  ... 
arXiv:1804.08317v1 fatcat:auhgihuiybcmhglipeh3nw72oy

Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines

Giorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang, Abhinav Srivastav, Denis Trystram, Michael Wagner
2018 European Symposium on Algorithms  
In this paper, we consider the online problem of scheduling independent jobs non-preemptively so as to minimize the weighted flow-time on a set of unrelated machines.  ...  Specifically, we show that there exists a O 1 3 -competitive algorithm for minimizing weighted flow-time on a set of unrelated machine that rejects at most O( )-fraction of total weight of jobs.  ...  For the online non-preemptive problem of minimizing the total weighted flow-time, Chekuri et al.  ... 
doi:10.4230/lipics.esa.2018.59 dblp:conf/esa/LucarelliMTST18 fatcat:lx2xe4k2avgghd2w2wt2cqk624

Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines

Panneerselvam Senthilkumar, Sockalingam Narayanan
2010 Intelligent Information Management  
The single machine scheduling problem with uniform parallel machines consists of n jobs, each with single operation, which are to be scheduled on m parallel machines with different speeds.  ...  Since, this scheduling problem is a combinatorial problem; usage of a heuristic is inevitable to obtain solution in polynomial time.  ...  all the jobs which are scheduled on all the machines. 13 Online scheduling of non-preemptive jobs to maximize the minimum the completion times (machine covering problem) Online scheduling Non-preemptive  ... 
doi:10.4236/iim.2010.28056 fatcat:cugkndehgrgedbxdjuga7mz7e4

Non-Preemptive Flow-Time Minimization via Rejections [article]

Anupam Gupta and Amit Kumar and Jason Li
2018 arXiv   pre-print
We consider the online problem of minimizing weighted flow-time on unrelated machines.  ...  This is arguably the weakest assumption in which such a result is known for weighted flow-time on unrelated machines.  ...  Our Results We consider the problem of non-preemptive scheduling on unrelated machines where the objective is to minimize total weighted flow-time of jobs.  ... 
arXiv:1805.09602v1 fatcat:xkgffkmtjjfb7mvwt3nexdg7oa

Non-Preemptive Flow-Time Minimization via Rejections

Anupam Gupta, Amit Kumar, Jason Li, Michael Wagner
2018 International Colloquium on Automata, Languages and Programming  
We consider the online problem of minimizing weighted flow-time on unrelated machines.  ...  This is arguably the weakest assumption in which such a result is known for weighted flow-time on unrelated machines.  ...  Introduction Consider the problem of scheduling jobs for weighted flow-time minimization. Given a set of m unrelated machines, jobs arrive online and have to be processed on one of these machines.  ... 
doi:10.4230/lipics.icalp.2018.70 dblp:conf/icalp/GuptaKL18 fatcat:yqlqqbb5zbgntpkliylanlcfba

Online Non-preemptive Scheduling on Unrelated Machines with Rejections [article]

Giorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang, Abhinav Srivastav, Denis Trystram
2018 arXiv   pre-print
Specifically, the paper presents algorithms for the following two objectives: minimizing the total flow-time and minimizing the total weighted flow-time plus energy under the speed-scaling mechanism.  ...  Indeed, few non-preemptive online schedulers are known to have strong foundational guarantees. This gap is likely due to strong lower bounds on any online algorithm for popular objectives.  ...  Models, Problems and Contribution Non-Preemptive Total Flow-time Minimization In this problem, we are given a set of unrelated machines M and jobs arrive on-line.  ... 
arXiv:1802.10309v1 fatcat:6zti6zao6ncm5phzol6np7uape

Minimizing the stretch when scheduling flows of divisible requests

Arnaud Legrand, Alan Su, Frédéric Vivien
2008 Journal of Scheduling  
We recall known results on closely related problems, we show how to minimize the max-stretch on unrelated machines either in the divisible load model or with preemption, we derive new lower bounds on the  ...  We explain the relationship between our model and the preemptive single processor case, and we show how to extend algorithms that have been proposed in the literature for the single processor model to  ...  We also like to thank Michael Bender who presented us some known algorithms for minimizing max-stretch on one machine with preemption.  ... 
doi:10.1007/s10951-008-0078-4 fatcat:7g6lmsc4zfcubh6d66ccvyypga

Online Non-Preemptive Scheduling to Minimize Maximum Weighted Flow-Time on Related Machines

Giorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang, Abhinav Srivastav, Denis Trystram, Michael Wagner
2019 Foundations of Software Technology and Theoretical Computer Science  
We consider the problem of scheduling jobs to minimize the maximum weighted flow-time on a set of related machines.  ...  We present the first constant competitive algorithm for minimizing the maximum weighted flow-time on related machines by relaxing the problem and assuming that the online algorithm can reject a small fraction  ...  Introduction We study the problem of online scheduling non-preemptive jobs to minimize the maximum (or ∞ -norm of the) weighted flow-time on related machines.  ... 
doi:10.4230/lipics.fsttcs.2019.24 dblp:conf/fsttcs/LucarelliMTST19 fatcat:3gknfaamyzb6ref7ja2kkeajjq

Editorial

Ceyda Oğuz, Kirk Pruhs
2009 Journal of Scheduling  
In the paper "Optimal and Online Preemptive Scheduling on Uniformly Related Machines", Ebenlendr and Sgall address the problem of preemptive scheduling on uniformly related machines and present a semi-online  ...  In the paper "Power-Aware Scheduling for Makespan and Flow", Bunde addresses offline scheduling algorithms that incorporate speed scaling to address the bicriteria problem of minimizing energy consumption  ... 
doi:10.1007/s10951-009-0102-3 fatcat:anm5w72wuvhmhhystfzehbabwe

Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling [chapter]

Kim Thang Nguyen
2013 Lecture Notes in Computer Science  
We consider the online scheduling problem to minimize total weighted flow-time plus energy where the energy power f (s) is a function of speed s and is given by s α for α ≥ 1.  ...  We revisit algorithms EQUI and LAPS in Non-clairvoyant Scheduling to minimize total flow-time. We give simple analyses to prove known facts on the competitiveness of such algorithms.  ...  We would like to thank Kirk Pruhs and anonymous reviewers for pointing out related references and useful comments.  ... 
doi:10.1007/978-3-642-40450-4_64 fatcat:jzcu2qrxwnhxvhas7aczdhncni

Scheduling (Dagstuhl Seminar 16081)

Nikhil Bansal, Nicole Megow, Clifford Stein, Marc Herbstritt
2016 Dagstuhl Reports  
This report documents the program and the outcomes of Dagstuhl Seminar 16081 "Scheduling".  ...  The seminar was centered around recent new developments, discussion of open problems and exploring future research directions within the broader scheduling community.  ...  We consider two related scheduling problems: resource constrained scheduling on identical parallel machines and a generalization with resource dependent processing times.  ... 
doi:10.4230/dagrep.6.2.97 dblp:journals/dagstuhl-reports/BansalMS16 fatcat:7yjnnvu26vcjfa3r6nknvrpkk4

Page 2006 of The Journal of the Operational Research Society Vol. 60, Issue Supplement 1 [page]

2009 The Journal of the Operational Research Society  
An algorithm for single machine sequencing with release dates to minimize total weighted completion time. Disc Appl Math 5: 99-109. Held M and Karp RM (1971).  ...  On preemptive scheduling of unrelated parallel processors by linear programming. J Assoc Comput Mach 25: 612-619. Lawler EL and Moore JM (1969).  ... 

Scheduling jobs that arrive over time [chapter]

Cynthia Phillips, Clifford Stein, Joel Wein
1995 Lecture Notes in Computer Science  
Many of the algorithms generalize to the minimization of average weighted completion time as well. ' P  ...  Many of the algorithms are based on interesting algorithmic and structural relationships between preemptive and nonpreemptive schedules and linear programming relaxations of both.  ...  To solve these problems, we introduce an integer program that is closely related to optimal preemptive schedules to minimize average weighted completion time on unrelated machines.  ... 
doi:10.1007/3-540-60220-8_53 fatcat:bwfb6ysqdjgunkvf7v3eaolzey

A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation

Jivitej S. Chadha, Naveen Garg, Amit Kumar, V. N. Muralidhara
2009 Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09  
We consider the online problem of scheduling jobs on unrelated machines so as to minimize the total weighted flow time.  ...  average flow time on parallel machines.  ...  PRELIMINARIES AND THE SCHEDUL-ING ALGORITHM We consider the on-line problem of minimizing total weighted flow-time on unrelated machines.  ... 
doi:10.1145/1536414.1536506 dblp:conf/stoc/ChadhaGKM09 fatcat:hbylkj6ye5hp7daipvk4ynhyea

Online Scheduling with Makespan Minimization: State of the Art Results, Research Challenges and Open Problems [article]

Debasis Dwibedy, Rakesh Mohanty
2020 arXiv   pre-print
On arrival of a job, the scheduler assigns the job irrevocably to a machine before the availability of the next job with an objective to minimize the completion time of the scheduled jobs.  ...  This paper highlights the state of the art contributions for online scheduling of a sequence of independent jobs on identical and uniform related machines with a special focus on preemptive and non-preemptive  ...  on 2-identical machines to minimize weighted mean flow time.  ... 
arXiv:2001.04698v1 fatcat:4pnxnrya6nfvdcuwx5tstljb3m
« Previous Showing results 1 — 15 out of 502 results