749 Hits in 7.1 sec

Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines

Panneerselvam Senthilkumar, Sockalingam Narayanan
2010 Intelligent Information Management  
Under each of the first two categories, the available literatures are discussed under different groups based on different measures of performance and non-preemptive/preemptive nature of the jobs.  ...  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.  ...  Epstein, Noga, Seiden, Sgall and Woeginger [67] [68], studied the problem of on-line scheduling on two uniform machines with speeds 1 and s ≥ 1.  ... 
doi:10.4236/iim.2010.28056 fatcat:cugkndehgrgedbxdjuga7mz7e4

Preemptive scheduling with rejection

Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger
2003 Mathematical programming  
Finally, we argue that our results for unrelated machines can be carried over to the corresponding preemptive open shop scheduling problem with rejection.  ...  The scheduler may reject a subset of the jobs and thereby incur jobdependent penalties for each rejected job, and he must construct a schedule for the remaining jobs so as to optimize the preemptive makespan  ...  [6] , preemptive makespan minimization with rejection is hard even in the case of two identical machines.  ... 
doi:10.1007/s10107-002-0324-z fatcat:yxit66xtvba4ld452su6z3duy4

Page 8338 of Mathematical Reviews Vol. , Issue 2004j [page]

2004 Mathematical Reviews  
algorithm for uniform parallel machine scheduling with release dates.  ...  preemptive scheduling of jobs with deadlines on multiple machines.  ... 

Preemptive Scheduling with Rejection [chapter]

Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger
2000 Lecture Notes in Computer Science  
The scheduler may reject a subset of the jobs and thereby incur job-dependent penalties for each rejected job, and he must construct a schedule for the remaining jobs so as to optimize the preemptive makespan  ...  We provide a complete classification of these scheduling problems with respect to complexity and approximability. Our main results are on the variant with an arbitrary number of unrelated machines.  ...  Related scheduling problems with rejection have been studied by Bartal, Leonardi, Marchetti-Spaccamela, Sgall & Stougie [2] for non-preemptive makespan on identical machines, by Engels, Karger, Kolliopoulos  ... 
doi:10.1007/3-540-45253-2_25 fatcat:6nyrgt7rbngm5hinpqodhg2nmi

Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times [article]

Max A. Deppert, Klaus Jansen
2018 arXiv   pre-print
Recently Jansen et al. found an EPTAS for the splittable and non-preemptive case but with impractical running times exponential in 1/ε.  ...  We investigate the scheduling of n jobs divided into c classes on m identical parallel machines.  ...  Non-preemptive scheduling on machines with setup times.  ... 
arXiv:1810.01223v1 fatcat:lo4iszvw45dk5hfovtdmixjnuy

Approximation Algorithms for Scheduling with Class Constraints [article]

Klaus Jansen and Alexandra Lassota and Marten Maack
2019 arXiv   pre-print
The algorithm for the non-preemptive case has a ratio of 7/3 and a running time of O(n^2 log^2(n)). All results even hold if the number of machines cannot be bounded by a polynomial in n.  ...  The splittable and the preemptive case admit algorithms with ratio 2 and a running time of O(n^2 log(n)).  ...  For the non-preemptive case we adapt the algorithms to obtain a ratio of 7/3.  ... 
arXiv:1909.11970v1 fatcat:emektwku75bpdl26swltkyr4gi

On Solving Non-preemptive Mixed-criticality Match-up Scheduling Problem with Two and Three Criticality Levels [article]

Antonin Novak, Premysl Sucha, Zdenek Hanzalek
2016 arXiv   pre-print
efficient exact algorithms and we present computational experiments for instances with up to 200 tasks.  ...  We show the derivation of F-shaped tasks from the probability distribution function of the processing time, then we study the structure of problems with two and three criticality levels for which we propose  ...  On Solving Non-preemptive Mixed-criticality Match-up Scheduling Problem with Two and  ... 
arXiv:1610.07384v1 fatcat:qxrvantw7ngrdpgziucujswsjq

Semi-online Scheduling: A Survey [article]

Debasis Dwibedy, Rakesh Mohanty
2020 arXiv   pre-print
such as preemptive and non-preemptive with the optimality criteria such as Min-Max and Max-Min.  ...  The survey first introduces the online and semi-online algorithmic frameworks for the multi-processor scheduling problem with important applications and research motivation, followed by a taxonomy for  ...  [96] initiated the study on semi-online scheduling in 2-uniform machine with job rejection policy by considering S 1 =1, S 2 ≥ 1.  ... 
arXiv:2005.08614v1 fatcat:o72fqynztrgxziwk46fsqbn5hu

Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups Times

Klaus Jansen, Kim-Manuel Klein, Marten Maack, Malin Rau, Michael Wagner
2018 Innovations in Theoretical Computer Science  
For instance, we investigate the case that jobs can be split and scheduled on multiple machines.  ...  Furthermore, we present an EPTAS for a problem where classes of (non-splittable) jobs are given, and a setup has to be paid for each class of jobs being executed on one machine.  ...  Acknowledgements We thank Syamantak Das for helpful discussions on the problem. 1 German Research Foundation (DFG) project JA 612/20-1  ... 
doi:10.4230/lipics.itcs.2019.44 dblp:conf/innovations/JansenKMR19 fatcat:cj3bfgbtebg3lkjpvtfuazrmpi

Graph Coloring Problems in Modern Computer Science

Besjana Tosuni
2015 European Journal of Interdisciplinary Studies  
This papers mainly focused on important applications such as Guarding an Art Gallery, Physical layout segmentation, Round-Robin Sports Scheduling, Aircraft scheduling, Biprocessor tasks, Frequency assignment  ...  Graph coloring is one of the most important concepts in graph theory and is used in many real time applications in computer science.  ...  The preemptive and non-preemptive versions of the problem can have very different complexity: while the non-preemptive version can be solved in polynomial time for trees [20] , the preemptive version  ... 
doi:10.26417/ejis.v2i1.p87-95 fatcat:tmzb4azcr5hxrjcqnuuwf4iadu

Schedulability analysis of preemptive and nonpreemptive EDF on partial runtime-reconfigurable FPGAs

Nan Guan, Qingxu Deng, Zonghua Gu, Wenyao Xu, Ge Yu
2008 ACM Transactions on Design Automation of Electronic Systems  
We derive utilization bounds for several variants of global preemptive/nonpreemptive EDF scheduling, and compare the performance of different utilization bound tests.  ...  task scheduling on CPUs.  ...  Similar to preemptive EDF scheduling, we can define two variants of global non-preemptive EDF for FPGAs: NP-EDF-FkF and NP-EDF-NF.  ... 
doi:10.1145/1391962.1391964 fatcat:5ugpa65nnffm7fnfxtgtb2omzq

Order acceptance and scheduling: A taxonomy and review

Susan A. Slotnick
2011 European Journal of Operational Research  
Dósa and He (2006a) study preemptive and non-preemptive versions for online scheduling on two uniform machines with rejection, to minimize the sum of makespan and rejection penal ties.  ...  The author develops a two-part algorithm, which adapts the rejection procedure of Bartal et al. (2000) and a preemptive on line scheduling algorithm of Chen et al. (1995) .  ... 
doi:10.1016/j.ejor.2010.09.042 fatcat:6xttqh2c4fhqjboou2tgffuary

Implementation & Performance Analysis of Real Time Scheduling Algorithms for Three Industrial Embedded Applications (IEA)

Vishal Vora
2012 International Journal of Advanced Information Technology  
Some real time scheduling algorithms like Pre-emptive & Non Preemptive, Round Robin Scheduling, &Time Slicing are few of the favourites for various embedded applications.  ...  Various Scheduling algorithms are used for this purpose to enhance performance, accuracy and security of embedded system applications.  ...  ACKNOWLEDGEMENTS The authors would like to acknowledge math works incorporation, Management and R &D Team of Orpat Pvt. Ltd, India for providing required infrastructure for this work.  ... 
doi:10.5121/ijitcs.2012.2601 fatcat:5tulrevslngmrauujomd527nny

Random trees in queueing systems with deadlines

U. Schmid
1995 Theoretical Computer Science  
The value pT depends on the particular scheduling algorithm, and its derivation is based on the combinatorial and asymptotic analysis of certain random trees.  ...  Relying on a discrete-time single-server queueing system, we investigated deadline meeting properties of several scheduling algorithms employed for servicing probabilistically arriving tasks, characterized  ...  Blieberger and A. Vrchoticky for reading and commenting on an earlier version of the manuscript. The overall appearance of the paper has been  ... 
doi:10.1016/0304-3975(94)00282-n fatcat:v6g4vsmfpjetpi37grql2dfvce

On-Line Hard Real-Time Scheduling of Parallel Tasks on Partitionable Multiprocessors

Davender Babbar, Phillip Krueger
1994 1994 International Conference on Parallel Processing (ICPP'94)  
Each original is also photographed in one exposure and is included in reduced form at the back o f the book.  ...  Oversize materials (e.g., maps, drawings, charts) are reproduced by sectioning the original, beginning at the upper left-hand corner and continuing from left to right in equal sections with small overlaps  ...  They also proposed an optim al on-line scheduling algorithm for task sets with one com m on deadline and any system with one or more processors.  ... 
doi:10.1109/icpp.1994.140 dblp:conf/icpp/BabbarK94 fatcat:clfxfi6fczgivgd3rybe2er23e
« Previous Showing results 1 — 15 out of 749 results