Filters








91,713 Hits in 4.5 sec

The Two-stage Assembly Flow Shop Scheduling with an Availability Constraint: Worst Case Analysis

Hatem Hadda, Najoua Dridi, Sonia Hajri-Gabouj
2013 Journal of Mathematical Modelling and Algorithms in Operations Research  
We provide two heuristics with tight worst-case ratio bound of 2 when the availability constraint is imposed on one of the first stage's machines.  ...  In this paper, we deal with the two-stage assembly flow shop scheduling problem with an availability constraint. The objective is to minimize the maximum completion time of the jobs (i.e. makespan).  ...  [22] presented, for the 3MAF, a series of heuristics based on the ideas of Johnson [11] and Gupta [8] , they also gave a worst-case analysis.  ... 
doi:10.1007/s10852-013-9235-7 fatcat:3k6l2vw35rfwrlnjpch4akv5mm

Analysis of Transmissions Scheduling with Packet Fragmentation

Nir Namman, Raphaël Rom
2001 Discrete Mathematics & Theoretical Computer Science  
We present both worst case and average case results and compare them to the case where fragmentation is not allowed.  ...  We define a version of the well-known Next-Fit algorithm, capable of fragmenting items, and investigate its performance.  ...  Section 3 presents worst case analysis of the scheduling algorithm. Section 4 is devoted to average case analysis.  ... 
doi:10.46298/dmtcs.277 fatcat:mmral2w3e5colkvmx64tciruxa

A new algorithm to prove the schedulability of real-time systems

Shuhua Wang, Georg Färber
2000 Control Engineering Practice  
To obtain a tight upper bound for the worst-case response time, the concepts of local critical instant and local worst-case response time are introduced.  ...  In this paper a new algorithm to prove the schedulability of real-time systems is proposed, in which both precedence constraints and communication costs are considered and represented by o!  ...  In that paper, the computation of the worst-case response time is divided into two parts: transaction response time and interference of other transactions.  ... 
doi:10.1016/s0967-0661(00)00011-3 fatcat:dajzawsqjjcdlbg36ddg23g3dm

Semi-on-line scheduling problems for maximizing the minimum machine completion time

He Yong
2001 Acta Mathematicae Applicatae Sinica (English Series)  
On-line, analysis of algorithm, worst-case analysis 1.  ...  In a worst case analysis, the performance of an on-line or a semi-on-line algorithm is measured through the worst-case ratio with respect to the optimal solution of the off-line problem.  ...  Yao Enyu for their great encouragement for his research on scheduling.  ... 
doi:10.1007/bf02669690 fatcat:t5a5opyup5bsjfnpqsgbbkhsqm

A modular measure of competitiveness for distributed algorithms

James Aspnes, Orli Waarts
1995 Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95  
In e ect, once we x a schedule, we are doing worst-case analysis with respect to inputs, so we get the same modularity properties of standard worst-case analysis. One di culty remains.  ...  Much of the work that has applied competitive analysis to distributed problems has the on-line and optimal algorithms compete only on the same input, generally hiding the details of the schedule in a worst-case  ...  In e ect, once we x a schedule, we are doing worst-case analysis with respect to inputs, so we get the same modularity properties of standard worst-case analysis. One di culty remains.  ... 
doi:10.1145/224964.224991 dblp:conf/podc/AspnesW95 fatcat:m2bbs3p76nco7dmxbyx5uzg2uy

Approximation algorithms for single machine scheduling with one unavailability period

Imed Kacem, Mohamed Haouari
2008 4OR  
We derive an approximation algorithm for the general case and we show that the worst-case bound of the sequence yielded by Schrage's algorithm is equal to 2 and that this bound is tight.  ...  Some consequences of this result are also presented.  ...  The authors would like to thank two anonymous referees for their helpful suggestions which have significantly improved the presentation of this paper.  ... 
doi:10.1007/s10288-008-0076-6 fatcat:xsdnqbz5ofbt7dgukqam77hymm

Maximizing Throughput for Optical Burst Switching Networks

Jikai Li, Chunming Qiao, Jinhui Xu, Dahai Xu
2007 IEEE/ACM Transactions on Networking  
In this paper, we use competitive analysis to analyze the worstcase performance of a large set of scheduling algorithms, called best-effort online scheduling algorithms, for OBS networks, and establish  ...  Our analysis shows that the performance of any best-effort online algorithm is closely related to a few factors, such as the range of offset time, burst length ratio, scheduling algorithm, and number of  ...  WORST-CASE ANALYSIS In this section, we present our results on the worst-case analysis of best-effort online scheduling algorithms for OBS networks without FDLs.  ... 
doi:10.1109/tnet.2007.896171 fatcat:46jbw3s4hndthkiltqmpmc6q6y

Scheduling task dependence graphs with variable task execution times onto heterogeneous multiprocessors

Nadathur R. Satish, Kaushik Ravindran, Kurt Keutzer
2008 Proceedings of the 7th ACM international conference on Embedded software - EMSOFT '08  
We present two scheduling algorithms based on statistical makespan analysis. The first is a heuristic based on a critical path analysis of the task dependence graph.  ...  Scheduling methods in the presence of variations typically rely on worst-case timing estimates for hard real-time applications, or average-case analysis for other applications.  ...  Further, the worst-case analysis does not overestimate the two schedules equally: it is more accurate for schedule (b) than for schedule (a).  ... 
doi:10.1145/1450058.1450079 dblp:conf/emsoft/SatishRK08 fatcat:4nyljnk655c7tke36v6tufil7i

Page 3491 of Mathematical Reviews Vol. , Issue 83h [page]

1983 Mathematical Reviews  
We also discuss the problem of constructing no-wait schedules for these problems.” Kawaguchi, Tsuyoshi; Nakano, Hideo; Nakanishi, Yoshiro 83h:90042 Worst case analysis of a scheduling algorithm.  ...  Fisher, Marshall L. 83h:90040 Worst-case analysis of heuristic algorithms for scheduling and packing. Deterministic and stochastic scheduling ( Durham, 1981), pp. 15-34, NATO Adv. Study Inst.  ... 

Response time bounds for static-priority tasks and arbitrary relative deadlines with resource augmentation

Pascal Richard, Georges Kemayo, Frederic Ridouard, Emmanuel Grolleau, Thi Huyen Chau Nguyen
2012 Proceedings of 2012 IEEE 17th International Conference on Emerging Technologies & Factory Automation (ETFA 2012)  
and the amount of extra processor speed required to achieve exact worst-case response times.  ...  In this paper we propose parametric approximation algorithm (Fully Polynomial Time Approximation Scheme -FPTAS) that defines a compromise on the precision of computed worst-case response time upper bounds  ...  Section 3 presents the extension of the revised schedulability analysis presented in [12] for defining a parametric algorithm (i.e., FPTAS) for computing upper bounds of worst-case response times.  ... 
doi:10.1109/etfa.2012.6489567 dblp:conf/etfa/RichardKRGN12 fatcat:ffxdwticybdhhn3tjlozdomdzi

Utilization Bound Scheduling Analysis for Nonpreemptive Uniprocessor Architecture Using UML-RT

S. Ewins Pon Pushpa, Manamalli Devasigamani
2014 Modelling and Simulation in Engineering  
The obtained task set possesses the advantage of Rate Monotonic Algorithm and Shortest Job First priority scheme.  ...  Further, the task set is tested for schedulability, by first deriving a general schedulability condition from "problem window" analysis and, a necessary and sufficient schedulability condition for a task  ...  Conflict of Interests The authors declare that there is no conflict of interests regarding the publication of this paper.  ... 
doi:10.1155/2014/705929 fatcat:nxghmrreybeebc5yj3b27jzem4

The End Of The Line For Static Cyclic Scheduling?

N. Audsley, K. Tindell, A. Burns
1993 Fifth Euromicro Workshop on Real-Time Systems  
Section 5 gives analysis to bound worst-case response times for such tasks.  ...  Most analysis for such systems attempts to find the worst-case response time for each task by assuming that the worst-case scheduling point is when all tasks in the system are released simultaneously.  ...  This has been achieved in two ways: efficient optimal priority assignment and less-pessimistic worst-case response time analysis.  ... 
doi:10.1109/emwrt.1993.639042 dblp:conf/ecrts/AudsleyTB93 fatcat:rxn7rxzctna7rkfzt23dheul6e

Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage

Bo Chen
1995 Journal of the Operational Research Society  
Furthermore, we give a complete theoretical analysis of the worst-case performance of the classes.  ...  In this paper we classify these heuristics into three major groups, and provide a complete theoretical analysis of the worst-case performance of the classes.  ... 
doi:10.2307/2583992 fatcat:f4z5frltxvaxpnlk5l5f3vwnym

A New Strategy for Improving the Effectiveness of Resource Reclaiming Algorithms in Multiprocessor Real-Time Systems

Indranil Gupta, G. Manimaran, C. Siva Ram Murthy
2000 Journal of Parallel and Distributed Computing  
Tasks in such systems have deadlines to be met, and most real-time scheduling algorithms use worst case computation times to schedule these tasks.  ...  worst case computation times.  ...  For schedulability analysis, tasks' worst case computation times must be taken into account.  ... 
doi:10.1006/jpdc.1999.1594 fatcat:nturhpccfrflhlvnm65k7g7h4q

Scheduling two groups of jobs with incomplete information

Guochuan Zhang, Xiaoqiang Cai, C. K. Wong
2003 Journal of Systems Science and Systems Engineering  
We study the scheduling problem P(n 1 ,n 2 ), where two groups of jobs are to be scheduled. The first job group is available beforehand.  ...  We show a lower bound of 3/2 even for very special cases. Best possible algorithms are presented for a number of cases. Furthermore, a heuristic is proposed for the general case.  ...  In the first paper on the worst-case analysis of scheduling heuristics, Graham (1966) showed that algorithm LS has a worst-case ratio of 2−1/m, where m is the number of machines.  ... 
doi:10.1007/s11518-006-0121-y fatcat:ppndabokprbp5besa45qyyn6m4
« Previous Showing results 1 — 15 out of 91,713 results