Filters








11 Hits in 4.3 sec

SRPT is 1.86-Competitive for Completion Time Scheduling [chapter]

Christine Chung, Tim Nonner, Alexander Souza
2010 Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms  
We show in Section 3 that SRPT is 1.86-competitive, which also improves upon the best known competitive ratio for P | r j , pmtn | j c j .  ...  To achieve this, they showed that, at any time 2t, SRPT has completed as many jobs as any other schedule could complete by time t.  ...  The authors would like to thank anonymous referees for their helpful comments, which significantly improved the exposition of this paper.  ... 
doi:10.1137/1.9781611973075.111 dblp:conf/soda/ChungNS10 fatcat:jovn3ztq5jdrxo3szmbyd6racu

Completion Time Scheduling and the WSRPT Algorithm [chapter]

Bo Xiong, Christine Chung
2012 Lecture Notes in Computer Science  
We consider the online scheduling problem of minimizing the total weighted and unweighted completion time on identical parallel machines with preemptible jobs.  ...  We also prove that the lower bound on the competitive ratio of WSRPT for this problem is 1.215.  ...  Sitters [6] then recently gave an algorithm that is 1.791-competitive for weighted completion time scheduling.  ... 
doi:10.1007/978-3-642-32147-4_37 fatcat:bhwqksidpja5rmurg2arzr4hbi

Efficient Algorithms for Average Completion Time Scheduling [chapter]

René Sitters
2010 Lecture Notes in Computer Science  
(SRPT) is 5/4-competitive w.r.t. the average completion time objective.  ...  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.  ...  Equations (1) and (2) complete the proof. Theorem 1 SRPT is 5/4-competitive for minimizing total completion time on identical machines. Proof: Let ϕ be an optimal schedule.  ... 
doi:10.1007/978-3-642-13036-6_31 fatcat:xj4j57favjabzpky5iwicuhosu

Competitive analysis for online scheduling in software-defined optical WAN

Su Jia, Xin Jin, Golnaz Ghasemiesfeh, Jiaxin Ding, Jie Gao
2017 IEEE INFOCOM 2017 - IEEE Conference on Computer Communications  
We design and analyze various greedy, online scheduling algorithms that can achieve 3competitive ratio for makespan, 2-competitive ratio for minimum sum completion time for jobs of unit size, and 3↵-competitive  ...  The goal of the scheduling problem is to minimize the makespan (the time to finish all transfers) or the total sum of completion times.  ...  Let SRPT(u) denote the total completion time of the SRPT schedule for jobs incident to u and TCT( ) to denote total completion time of a schedule for our SDN problem.  ... 
doi:10.1109/infocom.2017.8056969 dblp:conf/infocom/JiaJGDG17 fatcat:csqvjbyewfhdpiq4ehq3y43pdq

Using in-line equipment condition and yield information for maintenance scheduling and dispatching in semiconductor wafer fabs

THOMAS W. SLOAN, J. GEORGE SHANTHIKUMAR
2002 IIE Transactions  
This paper addresses the problem of how to schedule maintenance and production for a multiple-product, multiple-stage production system.  ...  The problem is based on the situation found in semiconductor wafer fabrication where the equipment condition deteriorates over time, and this condition aects the yield of the production process.  ...  Sloan Foundation grant for the study on``Competitive Semiconductor Manufacturing.''  ... 
doi:10.1080/07408170208928861 fatcat:ydkgntqeuneofoh5yqi7dfxjpi

Green Computing Algorithmics

Kirk Pruhs
2011 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science  
We discuss what green computing algorithmics is, and what a theory of energy as a computational resource isn't.  ...  As a consequence of this, if one knew the ordering of the release times and completion times, obtaining an optimal schedule subject to such an ordering constraint is straightforward.  ...  Shortest Remaining Processing Time (SRPT), Shortest Job First (SJF), Shortest Elapsed Time First (SETF), Multi-Level Feedback (MLF), are all known to be scalable for the objective of total delay on one  ... 
doi:10.1109/focs.2011.44 dblp:conf/focs/Pruhs11 fatcat:6j6pfim4fndfvphbnfbornipcm

Hybrid Solving Techniques for Project Scheduling Problems [article]

Jens Schulz, Technische Universität Berlin, Technische Universität Berlin, Rolf Möhring
2013
This work is the first to perform an in-depth complexity study for explaining infeasibilities and bound changes as detected by the propagation algorithms of the cumulative constraint.  ...  The idea to apply coefficient strengthening on the cumulative constraint, enables us to solve some of the hard highly cumulative instances for the first time.  ...  time by the shortest remaining processing time rule (SRPT-rule).  ... 
doi:10.14279/depositonce-3602 fatcat:lvrxq7gp2vaczpvhvn6mo756pu

Submitted Posters (pp 465–556)

2003 Annals of Nutrition and Metabolism  
We infused 6 healthy subjects (5M/1F) with a primed infusion of the tracers [methyl-2H3, 1-13C] methionine and [ring-2H5] phenylalanine (2.8 and 1.4 M/kg/h), for 3 h intravenously (IV) and 3 h intraduodenally  ...  No excess risk was found for underweight premenopausal women (HRR ϭ 1.20, 95% CI 0.77-1.86).  ...  In the non native group who ate Sourogh for a short time mild anemia is observed in these mothers but sever in newborns. It is recommended for campaigning against the wrong nutritional habit.  ... 
doi:10.1159/000073822 fatcat:rdpr3hjppjfcdmdxsj6klut3um

Human-driven Optimization [article]

Bin Lin
2007
A key challenge is that for many applications, particularly interactive applications, the user or developer is unlikely or unable to provide either the objective function f , or constraints.  ...  Buco and Heiko Ludwig, for very useful suggestions and also conversation during daily lunches. John also gave helpful comments on my work on the direct user control of CPU scheduling.  ...  the need for costly user studies), and second to serve as the foundation for a competitive complexity benchmark.  ... 
doi:10.21985/n23h78 fatcat:ybq7u42j7rbzlnxgbxnynefinu

A simulation study of dispatching rules and rework strategies in semiconductor manufacturing

M.E. Kuhl, G.R. Laubisch
2004 IEEE/SEMI Advanced Semiconductor Manufacturing Conference and Workshop (IEEE Cat. No.04CH37530)  
The treatment combinations are compared based on fab performance measures including cycle time, percentage on time, work-in-process, and the XTheoretical value.  ...  In order to stay competitive, manufacturers must be able to quickly adapt to produce new products, and they must achieve a high level of productivity.  ...  For semiconductor manufacturers to stay competitive, they must be able to properly make decisions.  ... 
doi:10.1109/asmc.2004.1309590 fatcat:e4zo3mxg7vgorl4v2wsmpimboy

The relativistic effect in intermetallic phases of gold, platinum and thallium [article]

Vyacheslav Saltykov, Universität Stuttgart, Universität Stuttgart
2011
achieved for the highly symmetric tetrahedral star ([Tl8](6–) cluster) in newly synthesized and characterized Cs18Tl8O6 only if spin–orbit coupling is taken into account.  ...  For the same [Tl8](6–) cluster contained in Cs8Tl8O, but crystallizing in a different structure, the correct structure is already reproduced on the scalar relativistic level and can [...]  ...  According to the temperature dependent measurements, the magnetic susceptibility for BaAu is independent of temperature in the region 20-300 K and is  mol = -1.5 × 10 -5  2.5 % / -1.86 × 10 -5  2.5  ... 
doi:10.18419/opus-6762 fatcat:lqmbxrzmz5gljitg6kvd74dqte