Filters








3,022 Hits in 4.2 sec

A class of on-line scheduling algorithms to minimize total completion time

X. Lu, R.A. Sitters, L. Stougie
2003 Operations Research Letters  
We give a general 2-competitive algorithm for the single machine problem.  ...  We consider the problem of scheduling jobs on-line on a single machine and on identical machines with the objective to minimize total completion time. We assume that the jobs arrive over time.  ...  In the competitive analysis of our algorithm the preemptive version of the problem plays an important role.  ... 
doi:10.1016/s0167-6377(03)00016-6 fatcat:4axiwev5inhelay336p3xj3j44

Scheduling to Minimize Average Completion Time Revisited: Deterministic On-line Algorithms

Nicole Megow, Andreas S. Schulz
2003 Social Science Research Network  
We consider the scheduling problem of minimizing the average weighted completion time on identical parallel machines when jobs are arriving over time.  ...  Our preemptive algorithm is 2-competitive, which actually meets the competitive ratio of the currently best randomized on-line algorithm for this scenario.  ...  Preemptive Parallel Machine Scheduling We consider the following extension of the single-machine preemptive WSPT rule to identical parallel machines.  ... 
doi:10.2139/ssrn.460981 fatcat:fs74k2hdg5b73nfary3pmp7yji

Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms [chapter]

Nicole Megow, Andreas S. Schulz
2004 Lecture Notes in Computer Science  
We consider the scheduling problem of minimizing the average weighted completion time on identical parallel machines when jobs are arriving over time.  ...  Our preemptive algorithm is 2-competitive, which actually meets the competitive ratio of the currently best randomized on-line algorithm for this scenario.  ...  Preemptive Parallel Machine Scheduling We consider the following extension of the single-machine preemptive WSPT rule to identical parallel machines.  ... 
doi:10.1007/978-3-540-24592-6_18 fatcat:hhlegkizpfbslj6jyu5zdri23y

Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines

Panneerselvam Senthilkumar, Sockalingam Narayanan
2010 Intelligent Information Management  
This paper presents a survey of single machine scheduling problem with uniform parallel machines.  ...  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.  ...  They gave a tight analysis of the competitive ratio for every speed ratio.  ... 
doi:10.4236/iim.2010.28056 fatcat:cugkndehgrgedbxdjuga7mz7e4

On-line scheduling to minimize average completion time revisited

N MEGOW
2004 Operations Research Letters  
We consider the scheduling problem of minimizing the average-weighted completion time on identical parallel machines when jobs are arriving over time.  ...  For both the preemptive and the nonpreemptive setting, we show that straightforward extensions of Smith's ratio rule yield smaller competitive ratios than the previously best-known deterministic on-line  ...  Preemptive parallel machine scheduling We consider the following extension of the single-machine preemptive WSPT rule to identical parallel machines.  ... 
doi:10.1016/s0167-6377(03)00157-3 fatcat:gawnyz4k6jdrjevqlbecvfnodq

On-line scheduling to minimize average completion time revisited

Nicole Megow, Andreas S Schulz
2004 Operations Research Letters  
We consider the scheduling problem of minimizing the average-weighted completion time on identical parallel machines when jobs are arriving over time.  ...  For both the preemptive and the nonpreemptive setting, we show that straightforward extensions of Smith's ratio rule yield smaller competitive ratios than the previously best-known deterministic on-line  ...  Preemptive parallel machine scheduling We consider the following extension of the single-machine preemptive WSPT rule to identical parallel machines.  ... 
doi:10.1016/j.orl.2003.11.008 fatcat:5mkda2tr7ve6jgtpkpu6pw3xiq

Page 5031 of Mathematical Reviews Vol. , Issue 2004f [page]

2004 Mathematical Reviews  
Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine. (English summary) J. Global Optim. 27 (2003), no. 1, 97-103.  ...  Summary: “We consider the NP-hard preemptive single-machine scheduling problem to minimize the total weighted completion time subject to release dates.  ... 

The power of?-points in preemptive single machine scheduling

Andreas S. Schulz, Martin Skutella
2002 Journal of Scheduling  
We consider the NP-hard preemptive single-machine scheduling problem to minimize the total weighted completion time subject to release dates.  ...  We also show that list scheduling in order of random -points drawn from the same schedule results in an on-line algorithm with competitive ratio 4 3 .  ...  Sched. 2002; 5:121-133 THE POWER OF -POINTS IN PREEMPTIVE SINGLE MACHINE SCHEDULING  ... 
doi:10.1002/jos.93 fatcat:crmom4jsdzfnhda3ngd3ejba7y

Total stretch minimization on single and identical parallel machines [article]

Abhinav Srivastav, Denis Trystram
2014 arXiv   pre-print
We consider the classical problem of scheduling n jobs with release dates on both single and identical parallel machines.  ...  For the preemptive version, the Shortest remaining processing time (SRPT) algorithm is known to give 2-competitive for sum stretch on single machine while its is 13-competitive on identical parallel machines  ...  Introduction We consider the problem of non-preemptive scheduling of jobs with release dates on single and identical parallel machines.  ... 
arXiv:1404.6502v2 fatcat:o25kfw3eaneyjeki4rb2kweqgu

LP-Based Online Scheduling: From Single to Parallel Machines [chapter]

José R. Correa, Michael R. Wagner
2005 Lecture Notes in Computer Science  
Using linear programming techniques, borrowed from the single machine case, we are able to design a 2.62-competitive deterministic algorithm for the non-preemptive version of the problem, improving upon  ...  Our algorithms naturally extend several approaches for single and parallel machine scheduling.  ...  We specially thank another anonymous referee for pointing out an error in a preliminary version of Theorem 5.3.  ... 
doi:10.1007/11496915_15 fatcat:x44sqaggxje4vg2xu6futo6koi

LP-based online scheduling: from single to parallel machines

José R. Correa, Michael R. Wagner
2008 Mathematical programming  
Using linear programming techniques, borrowed from the single machine case, we are able to design a 2.62-competitive deterministic algorithm for the non-preemptive version of the problem, improving upon  ...  Our algorithms naturally extend several approaches for single and parallel machine scheduling.  ...  We specially thank another anonymous referee for pointing out an error in a preliminary version of Theorem 5.3.  ... 
doi:10.1007/s10107-007-0204-7 fatcat:ergain75zraplmiuwj4nrubumy

Efficient Algorithms for Average Completion Time Scheduling [chapter]

René Sitters
2010 Lecture Notes in Computer Science  
For weighted completion times we give a deterministic algorithm with competitive ratio 1.791 + o(m). This ratio holds for preemptive and non-preemptive scheduling.  ...  We analyze the competitive ratio of algorithms for minimizing (weighted) average completion time on identical parallel machines and prove that the well-known shortest remaining processing time algorithm  ...  For a given instance I, let σ m (I) be its preemptive WSPT-schedule on the fast single machine.  ... 
doi:10.1007/978-3-642-13036-6_31 fatcat:xj4j57favjabzpky5iwicuhosu

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

Debasis Dwibedy, Rakesh Mohanty
2020 arXiv   pre-print
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  ...  Important competitive analysis results obtained by well-known deterministic and randomized online scheduling algorithms in the literature are presented along with research challenges and open problems.  ...  Acknowledgment This work is partially supported by Department of Computer Science and Engineering of Veer Surendra Sai University of Technology, Burla, Sambalpur, India.  ... 
arXiv:2001.04698v1 fatcat:4pnxnrya6nfvdcuwx5tstljb3m

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.  ...  The design and analysis of the algorithm is based on the primal-dual technique.  ...  [4] showed that any algorithm has at least Ω(n) competitive ratio for single machine where n is the number of jobs. [1] presented a scalable competitive algorithm for the preemptive problem on a set  ... 
doi:10.4230/lipics.esa.2018.59 dblp:conf/esa/LucarelliMTST18 fatcat:lx2xe4k2avgghd2w2wt2cqk624

From Preemptive to Non-preemptive Scheduling Using Rejections [chapter]

Giorgio Lucarelli, Abhinav Srivastav, Denis Trystram
2016 Lecture Notes in Computer Science  
We study the classical problem of scheduling a set of independent jobs with release dates on a single machine.  ...  We investigate the (offline) transformation of the SRPT schedule to a non-preemptive schedule subject to a recently introduced resource augmentation model, namely the rejection model according to which  ...  ⊓ ⊔ Since SRPT creates an optimal preemptive schedule for the problem of minimizing j∈J F j on a single machine and an optimal preemptive schedule is a lower bound for a non-preemptive one the following  ... 
doi:10.1007/978-3-319-42634-1_41 fatcat:hrwhxwvlcba3je3xo2nopiczfu
« Previous Showing results 1 — 15 out of 3,022 results