Filters








83,721 Hits in 5.7 sec

Approximating Real-Time Scheduling on Identical Machines [chapter]

Nikhil Bansal, Cyriel Rutten, Suzanne van der Ster, Tjark Vredeveld, Ruben van der Zwaan
2014 Lecture Notes in Computer Science  
We study the problem of assigning n tasks to m identical parallel machines in the real-time scheduling setting, where each task recurrently releases jobs that must be completed by their deadlines.  ...  In partitioned scheduling each task is assigned to one of the machines and all jobs corresponding to this task must be scheduled on that machine.  ...  Introduction The sporadic task system is one of the most widely adopted models for infinitely recurring executions in real-time systems.  ... 
doi:10.1007/978-3-642-54423-1_48 fatcat:zlkmukgscvdddp2nuwoe5qbmmq

Multi-Attribute Real Time Resource Approximation Based Efficient Job Shop Scheduling

C. Sivaprakasam, V. P Eswaramurthy
2017 International Journal of Advanced Scientific Research & Development (IJASRD)  
To overcome the deficiency in job shop scheduling, the author present an ant based multi attribute real time resource approximation technique.  ...  The multi attribute real time resource approximation technique considers make span time, waiting time, resource utilization as the name suggest.  ...  Also the method performs the polynomial scheduling based on time. In [6] , the identical parallel machines are scheduled on preemptive manner.  ... 
doi:10.26836/ijasrd/2017/v4/i9/4905 fatcat:tpwbtkypbzebjasqmtxn5wpxc4

Randomized truthful algorithms for scheduling selfish tasks on parallel machines

Eric Angel, Evripidis Bampis, Nicolas Thibault
2012 Theoretical Computer Science  
In this paper, we show the existence of randomized truthful (non-polynomial-time) algorithms with expected approximation ratio equal to 3/2 for different scheduling settings (identical machines with and  ...  We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in order to minimize the makespan  ...  Construct schedule 1 as follows: for every machine ( ≤ ≤ ), every task ( 1 ≤ ≤ ) in is executed on machine by starting at time max − ∑ = . 3.  ... 
doi:10.1016/j.tcs.2011.10.006 fatcat:onnrwd5e5vdcze535nzosclybu

Page 864 of The Journal of the Operational Research Society Vol. 53, Issue 8 [page]

2002 The Journal of the Operational Research Society  
For the identical parallel-machine scheduling problem, each job requires only a single operation, which may be processed on any of the parallel machines with identical processing time.  ...  For the uniform parallel-machine scheduling problem, the job processing time is determined by the efficiency of the machines and the job processing times are all the same on each single machine.  ... 

Malleable Scheduling Beyond Identical Machines

Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos, Michael Wagner
2019 International Workshop on Approximation Algorithms for Combinatorial Optimization  
identical machines.  ...  In malleable job scheduling, jobs can be executed simultaneously on multiple machines with the processing time depending on the number of allocated machines.  ...  Acknowledgements Part of this work was carried out while the authors participated in the program "Real-Time Decision Making" at the Simons Institute for the Theory of Computing, Berkeley, CA.  ... 
doi:10.4230/lipics.approx-random.2019.17 dblp:conf/approx/FotakisMP19 fatcat:bel6pl5225hxbhg62kkbvadua4

Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines [chapter]

Eric Angel, Evripidis Bampis, Nicolas Thibault
2010 Lecture Notes in Computer Science  
In this paper, we show the existence of randomized truthful (non-polynomial-time) algorithms with an expected approximation ratio equal to 3/2 for different scheduling settings (identical machines with  ...  We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in order to minimize the makespan  ...  and task j k is executed on machine j by starting at time C OPT max − b j j k . 4. Choose schedule S 1 or S 2 each one with probability 1/2.  ... 
doi:10.1007/978-3-642-12200-2_5 fatcat:wyrmsumuwjbhjceyrjh43afbc4

Online Hierarchical Job Scheduling on Grids [chapter]

Andrei Tchernykh, Uwe Schwiegelshohn, Ramin Yahyapour, Nikolai Kuzjurin
2008 From Grids to Service and Pervasive Computing  
In this paper, we address non preemptive online scheduling of parallel jobs on a Grid. The Grid consists of a large number of identical processors that are divided into several machines.  ...  We consider a Grid scheduling model with two stages. At the first stage, jobs are allocated to a suitable machine while at the second stage, local scheduling is applied to each machine independently.  ...  While a real Grid often consists of heterogeneous parallel machines, one can argue that an identical processor model is still reasonable as most modern processors in capacity computing mainly differ in  ... 
doi:10.1007/978-0-387-09455-7_6 fatcat:x5dmfmnmtrclxmhx2khq3rgxsy

Optimal Time-Critical Scheduling via Resource Augmentation

Phillips, Stein, Torng, Wein
2002 Algorithmica  
We consider two fundamental problems in dynamic scheduling: scheduling to meet deadlines in a preemptive multiprocessor setting, and scheduling to provide good response time in a number of scheduling environments  ...  For the optimization of average flow time, these are the first results of any sort, for any MP-hard version of the problem, that indicate that it might be possible to design good approximation algorithms  ...  Furthermore, even if one accepts best-effort real-time scheduling as a reasonable way to approximate hard-real-time scheduling, Ko- where m is the number of machines and A is the ratio between the weights  ... 
doi:10.1007/s00453-001-0068-9 fatcat:ac35hr6ezvcctaaeo5yud35x64

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

Preface: Multiprocessor Scheduling, Theory and Applications [chapter]

Eugene Levner
2007 Multiprocessor Scheduling, Theory and Applications  
, approximation algorithms with performance guarantees, heuristics and metaheuristics; novel models and approaches to scheduling; and, last but least, several real-life applications and case studies.  ...  Preface Scheduling theory is concerned with the optimal allocation of scarce resources (for instance, machines, processors, robots, operators, etc.) to activities over time, with the objective of optimizing  ...  Chapter 6 studies on-line approximation algorithms with performance guarantees for an important class of scheduling problems defined on identical machines, for jobs with arbitrary release times.  ... 
doi:10.5772/5211 fatcat:i4hco3bepjeo3i2eps3g46miga

Approximating the throughput of multiple machines under real-time scheduling

Amotz Bar-Noy, Sudipto Guha, Joseph (Seffi) Naor, Baruch Schieber
1999 Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99  
Each of the jobs is associated with a release time, a deadline, a weight, and a processing time on each of the machines.  ...  We give constant factor approximation algorithms for four variants of the problem, depending on the type of the machines (identical vs. unrelated) and the weight of the jobs (identical vs. arbitrary).  ...  We are indebted to Joel Wein for many helpful discussions, and especially for his suggestion to consider the general case of maximizing the throughput of jobs with release times and deadlines.  ... 
doi:10.1145/301250.301420 dblp:conf/stoc/Bar-NoyGNS99 fatcat:7jhmcmymqbegzlyytmpd5riwle

The VCG Mechanism for Bayesian Scheduling [chapter]

Yiannis Giannakopoulos, Maria Kyropoulou
2015 Lecture Notes in Computer Science  
We study the problem of scheduling m tasks to n selfish, unrelated machines in order to minimize the makespan, where the execution times are independent random variables, identical across machines.  ...  We show that the VCG mechanism, which myopically allocates each task to its best machine, achieves an approximation ratio of O ln n ln ln n .  ...  If VCG is ρ-approximate for the prior free scheduling problem with identical machines on inputs for which the optimal allocation is fully balanced, then VCG is ρ-approximate for the Bayesian scheduling  ... 
doi:10.1007/978-3-662-48995-6_25 fatcat:h2m5xgggpjaxbe2j7giwswdv2u

Page 662 of Mathematical Reviews Vol. , Issue 2004a [page]

2004 Mathematical Reviews  
Summary: “We consider the problem of scheduling n preemptive jobs with deadlines on m identical parallel machines so as to minimize total completion time.  ...  on identical parallel machines subject to deadlines.  ... 

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

2009 The Journal of the Operational Research Society  
The problem that he addressed was that of minimizing the makespan on m identical parallel machines.  ...  (1984) on single machine and parallel machine models and by Tanaev ef al (1989) on shop scheduling models.  ... 

New Developments in Scheduling Applications

M. Duran Toksarı, Daniel Oron, Emel Kızılkaya Aydoğan, Jorge G. Barbosa
2014 The Scientific World Journal  
Xu investigate semionline scheduling on two machines with grade of service (GoS) levels and partial information of processing time.  ...  Dietz proposes a study on computing the expected cost of an appointment schedule for statistically identical customers with probabilistic service times.  ...  Xu investigate semionline scheduling on two machines with grade of service (GoS) levels and partial information of processing time.  ... 
doi:10.1155/2014/268941 pmid:24883373 pmcid:PMC4032687 fatcat:64ryuxgdjzdvbkvyv3votkhmla
« Previous Showing results 1 — 15 out of 83,721 results