5,101 Hits in 8.5 sec

Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms [chapter]

Juraj Hromkovič, Kathleen Steinhöfel, Peter Widmayer
2001 Lecture Notes in Computer Science  
We consider the job shop scheduling problem unit−J m , where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines.  ...  (iv) There is no deterministic on-line algorithm with a competitive ratio better than 4/3 for unit−J m with two jobs, and for three or more jobs, there is no deterministic on-line algorithm which is better  ...  It is a well-studied version of job shop scheduling with m different machines and unit length tasks, denoted by unit−J m . There are d jobs J 1 , J 2 , . . . , J d for some integer d ≥ 2.  ... 
doi:10.1007/3-540-45446-2_6 fatcat:fmrbavvpdjgjznvnwxymxiaon4

Job shop scheduling with unit length tasks

Meike Akveld, Raphael Bernhard
2011 RAIRO - Theoretical Informatics and Applications  
Using the results of Hromkovič, Mömke, Steinhöfel, and Widmayer presented in their work Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms, we analyze the problem setting for 2 jobs with  ...  More specifically, we deal with a particular version called job shop scheduling with unit length tasks.  ...  Acknowledgments The authors would like to thank Juraj Hromkovič, Karin Freiermuth and Dennis Komm for their support with ideas, proof-reading and corrections.  ... 
doi:10.1051/ita/2011132 fatcat:fcq47fb4vffxhg3cxenkh3245m

A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags

Peter Brucker, Thomas Hilbig, Johann Hurink
1999 Discrete Applied Mathematics  
ELSEVIER Discrete Applied Mathematics 94 (1999) 77 99 A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags Abstract Positive and negative time-lags  ...  are general timing restrictions between the starting time> of jobs which have been introduced by Roy in connection with the Metra Potential Method.  ...  Classical job-shop and open-shop problems were solved using reductions and this branch and bound algorithm.  ... 
doi:10.1016/s0166-218x(99)00015-3 fatcat:om6ulcufqvb4rnfsny7bywer34

Interval selection: Applications, algorithms, and lower bounds

Thomas Erlebach, Frits C.R. Spieksma
2003 Journal of Algorithms  
Concerning lower bounds, we show that for instances with intervals of arbitrary lengths, no deterministic myopic algorithm can achieve ratio better than 2 in the case of unit weights, better than ~ 7.103  ...  If all intervals have the same length, we give lower bounds of 3 + 2V2 for the case of arbitrary weights and 5 for the case of equal weights per job.  ...  Acknow ledgments We are deeply indebted to two anonymous referees for Journal of Algorithms who provided numerous comments and suggestions that helped to improve the paper.  ... 
doi:10.1016/s0196-6774(02)00291-2 fatcat:ek6oztzpgjd3zpeq6gj4hk2ix4

Bounds on multiprocessing anomalies and related packing algorithms

R. L. Graham
1971 Proceedings of the November 16-18, 1971, fall joint computer conference on - AFIPS '71 (Fall)  
The current state of affairs here seems to be similar to that of the job-shop scheduling problem 5 ,30 for which optimal schedules can be efficiently generated when L which (approximately) minimizes the  ...  Note that on D we have labeled the intervals above by the task and below by the length of time needed to execute the task.  ... 
doi:10.1145/1478873.1478901 dblp:conf/afips/Graham72 fatcat:q2gpljnjpndstdve75grwcsksi

A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems

M. Mezmaz, N. Melab, E-G. Talbi
2007 2007 IEEE International Parallel and Distributed Processing Symposium  
In this paper, we propose an adaptation of the parallel Branch and Bound algorithm for computational grids.  ...  algorithm.  ...  Acknowledgment We would like to thank the technical staffs of the Grid'5000, IEEA-FIL, IUT-A and Polytech'Lille for making their clusters accessible and fully operational.  ... 
doi:10.1109/ipdps.2007.370217 dblp:conf/ipps/MezmazMT07 fatcat:doxrobmcsre3zk4wewdehdmb6y

Task Scheduling in Networks

Cynthia Phillips, Clifford Stein, Joel Wein
1997 SIAM Journal on Discrete Mathematics  
Scheduling a set of tasks on a set of machines so as to yield an e cient schedule is a basic problem in computer science and operations research.  ...  For example, we give the rst non-trivial approximation algorithm to minimize the average weighted completion time of a set of jobs on related or unrelated machines, with or without a network.  ...  time, to David Peleg and Baruch Awerbuch for explaining their o -line approximation algorithm to us, and to Perry Fizzano for reading an earlier draft of this paper.  ... 
doi:10.1137/s0895480194279057 fatcat:ylec2334mfedljmjvwdtiynpge

An efficient load balancing strategy for grid-based branch and bound algorithm

M. Mezmaz, N. Melab, E.-G. Talbi
2007 Parallel Computing  
The approach has been applied to one instance of the bi-objective flow-shop scheduling problem.  ...  The most popular parallelization approach of the branch and bound algorithm consists in building and exploring in parallel the search tree representing the problem being tackled.  ...  Each task t ij is associated with a processing time p ij , and each job J i must be achieved before a due date d i .  ... 
doi:10.1016/j.parco.2007.02.004 fatcat:ijpbeeng3zcd3pdcyai2eqlldi

Fast Branch and Bound Algorithm for the Travelling Salesman Problem [chapter]

Radosław Grymin, Szymon Jagiełło
2016 Lecture Notes in Computer Science  
New strategies are proposed for implementing algorithms based on Branch and Bound scheme.  ...  Proposed approaches are compared with primary algorithms.  ...  The same author designed new parallel objective function determination methods for the job shop scheduling [3] and flow shop [1] problems.  ... 
doi:10.1007/978-3-319-45378-1_19 fatcat:jil42gkzozdipjdcnx72byzvxe

Scheduling production tasks in a two-stage FMS

J. Błażewicz, G. Pawlak, B. Walter
2002 International Journal of Production Research  
Computational experiments validated the model and the algorithms proposed.  ...  There are three storage places: unlimited input and output buffers and limited transitional one. The jobs are grouped into batches of identical parts.  ...  The quality of the solutions obtained the algorithms is compared with the lower bound of the schedule length.  ... 
doi:10.1080/00207540210159608 fatcat:jniujhoc7bht7d7rsmmxwhyiii

A Branch-and-Bound Algorithm for Minimizing the Energy Consumption in the PFS Problem

Guo-Sheng Liu, Bi-Xi Zhang, Hai-Dong Yang, Xin Chen, George Q. Huang
2013 Mathematical Problems in Engineering  
To solve this new problem, a branch-and-bound algorithm is developed. Two lower bounds are proposed, and an initial upper bound by using a variant of NEH heuristic algorithm is applied.  ...  Experimental results also validate the efficiency of the proposed algorithm for problems with job number not larger than 15.  ...  Acknowledgment This work was supported in part by the Humanity and Society Science Program of the Ministry of Education (12YJCZH129) and the National Natural Science Foundation of China (70971026 and 71271060  ... 
doi:10.1155/2013/546810 fatcat:wfb4hud2hvgbhhp2egjpi6g2tm

Scheduling multiprocessor tasks — An overview

Maciej Drozdowski
1996 European Journal of Operational Research  
The main part of the work is presentation of the results in multiprocessor tasks scheduling both for parallel and for dedicated processors.  ...  Multiprocessor tasks require more than one processor at the same moment of time. This relatively new concept in scheduling theory emerged with the advent of parallel computing systems.  ...  An O(n log n +nm) algorithm was proposed. First, a lower bound of the schedule length is calculated. Tasks with sizej = 2 are scheduled in the order of decreasing processing times.  ... 
doi:10.1016/0377-2217(96)00123-3 fatcat:q45q5nylzjd4jfxs6rki4mlaee

Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints [article]

Mehrnoosh Shafiee, Javad Ghaderi
2020 arXiv   pre-print
Motivated by modern parallel computing applications, we consider the problem of scheduling parallel-task jobs with heterogeneous resource requirements in a cluster of machines.  ...  Finally, in the case that migrations (and preemptions) are not allowed, we design an algorithm with an approximation ratio of 24.  ...  From a theoretical perspective, our problem of scheduling paralleltask jobs with synchronization, packing, and placement constraints, can be seen as a generalization of the concurrent open shop (COS) problem  ... 
arXiv:2004.00518v2 fatcat:e6imfcsq3zgytfmofhoogbieae

Some Results on Shop Scheduling with S-Precedence Constraints among Job Tasks

Alessandro Agnetis, Fabrizio Rossi, Stefano Smriglio
2019 Algorithms  
We address some special cases of job shop and flow shop scheduling problems with s-precedence constraints.  ...  shop, and an m-machine flow shop with two jobs.  ...  The Job Shop with Two Jobs and Two Machines In this section we describe a polynomial algorithm for the job shop problem with two jobs and two machines; i.e., J2|n = 2, s − prec|C max .  ... 
doi:10.3390/a12120250 fatcat:wglaol6wbbh65bnmem5lv63cbu

Scheduling Self-Suspending Tasks: New and Old Results

Jian-Jia Chen, Tobias Hahn, Ruben Hoeksma, Nicole Megow, Georg Von Der Brüggen, Michael Wagner
2019 Euromicro Conference on Real-Time Systems  
For frame-based periodic real-time tasks, in which the periods of all tasks are identical and all jobs related to one frame are released synchronously, we explore different approximation metrics with respect  ...  algorithms for systems with such suspension behavior, called the master-slave problem in the OR community.  ...  The authors also thank the organizing committee of MAPSP 2017 for planning a discussion session during the workshop, which initialized the study in this paper. 16:20 Scheduling Self-Suspending Tasks:  ... 
doi:10.4230/lipics.ecrts.2019.16 dblp:conf/ecrts/ChenHHMB19 fatcat:qafgshxxonblbb4us26xibnxv4
« Previous Showing results 1 — 15 out of 5,101 results