K.R. Baker. Introduction to Sequencing and Scheduling, chapter 2. Wiley, New York, 1974. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
A Simpler Proof of Preemptive Total Flow Time Approximation on.. - Leonardi (Correct)
....is impossible to achieve an approximation factor of O(n 3 ) unless NP = P [8] Thus, preemptions really seem to be essential. Minimizing the ow time on one machine with preemption can be done optimally in polynomial time using the natural algorithm shortest remaining processing time (SRPT) [4]. For more than one machine the preemptive problem becomes NP hard [5] Only very recently, Leonardi and Raz [8] showed that SRPT achieves logarithmic approximation for the multiprocessor case, showing a tight bound of O(log(minfn=m; Pg) on m 1 machines with n jobs, where P denotes the ratio ....
K.R. Baker. Introduction to Sequencing and Scheduling. Wiley, 1974.
Minimizing the Flow Time without Migration - Baruch Awerbuch Yossi (1999) (7 citations) (Correct)
....O(n ) approximation factor unless NP = P [7] Thus, preemptions really seem to be essential. Existing work: single processor. Minimizing the flow time on one machine with preemption can be done optimally in polynomial time using the natural algorithm shortest remaining processing time (SRPT) [1]. Existing work: multiple processors with migration. For more than one machine the preemptive problem becomes NP hard [2] Only very recently, Leonardi and Raz [7] STOC 97) showed that SRPT achieves logarithmic approximation for the multiprocessor case, showing a tight bound of O(log(min(n=m; ....
K.R. Baker. Introduction to Sequencing and Scheduling. Wiley, 1974.
Imperial College of Science, Technology and Medicine - University Of London (Correct)
....optimal one. Many different approaches have been proposed in this area (which is very well researched due to its pertinence to practical applications of scheduling) These include generation of active schedules in [GT60] and its variant on generating non active schedules, neighbourhood search in [Bak74] with a recent approach in [SWV92] and the shifting bottleneck procedure in [ABZ88] Here we concentrate on the generation of non delay schedules using priority rules. A non delay schedule is one in which no machine remains inactive when there exists a task which could be executed on the ....
K. R Baker. Introduction to Sequencing and Scheduling. John Wiley, New York, 1974.
Minimizing the Flow Time without Migration - Baruch Awerbuch Yossi (1999) (7 citations) (Correct)
....O(n ) approximation factor unless NP = P [7] Thus, preemptions really seem to be essential. Existing work: single processor. Minimizing the flow time on one machine with preemption can be done optimally in polynomial time using the natural algorithm shortest remaining processing time (SRPT) [1]. Existing work: multiple processors with migration. For more than one machine the preemptive problem becomes NP hard [2] Only very recently, Leonardi and Raz [7] STOC 97) showed that SRPT achieves logarithmic approximation for the multiprocessor case, showing a tight bound of ....
K.R. Baker. Introduction to Sequencing and Scheduling. Wiley, 1974.
Scheduling Master-Slave Multiprocessor - Sahni (Correct)
....by the master) slave work (performed by the slaves) and post processing (performed by the master) 4. for each job, the tasks are to be performed in the order: pre processing, slave work, post processing. The master slave scheduling model may be regarded as a generalized job shop (see [1, 2] for a definition of a job shop as well as for elementary terminology concerning scheduling) as described below: 1. the job shop has two classes of machines: master and slave 2. there is exactly one master machine and the number of slave machines equals the number of jobs 3. each job has three ....
K. Baker, Introduction to Sequencing and Scheduling, John Wiley, New York, 1974.
A Tight Lower Bound for the Best-α Algorithm - Torng, Uthaisombut (1999) (Correct)
No context found.
K.R. Baker. Introduction to Sequencing and Scheduling, chapter 2. Wiley, New York, 1974.
Generalization of EDF and LLF: identifying all optimal online.. - Uthaisombut (2005) (Correct)
No context found.
K.R. Baker. Introduction to Sequencing and Scheduling, chapter 2. Wiley, New York, 1974.
Lower bounds for SRPT-subsequence algorithms for.. - Torng, Uthaisombut (1999) (5 citations) (Correct)
No context found.
K.R. Baker. Introduction to Sequencing and Scheduling. Wiley, New York, 1974.
New Directions in Machine Scheduling - Uthaisombut (2000) (Correct)
No context found.
K.R. Baker. Introduction to Sequencing and Scheduling, chapter 2. Wiley, New York, 1974.
Single Machine Scheduling Subject to Precedence Delays - Finta, Liu (1995) (14 citations) (Correct)
No context found.
K. R. Baker, Introduction to Sequencing and Scheduling, J. Wiley, New York, 1974.
Single Machine Scheduling Subject to Precedence Delays - Finta, Liu (1994) (14 citations) (Correct)
No context found.
K. R. Baker, Introduction to Sequencing and Scheduling, J. Wiley, New York, 1974.
Task Structure Abstraction for Coordination - Kreuger, Aronsson, Lindblom (Correct)
No context found.
K. R. Baker. Introduction to sequencing and scheduling. Wiley & Sons, 1974.
Performance Optimization for Hard Real-Time Fixed Priority Tasks - Goossens, Richard (2004) (Correct)
No context found.
BAKER, K. Introduction to sequencing and scheduling. John Wiley and Sons, 1974.
List Scheduling in Order of alpha-Points on a Single Machine - Skutella (2002) (Correct)
No context found.
K. R. Baker. Introduction to Sequencing and Scheduling. John Wiley & Sons, New York, 1974.
Neighbourhood Constraint for a Tabu Search - Algorithm To Schedule (2001) (Correct)
No context found.
K. R. Baker. Introduction to Sequencing and Scheduling. John Wiley & Sons, 1974.
The Framework of User-Centric Optimization in Web-Based - Applications Ye Xia (2000) (Correct)
No context found.
Kenneth R. Baker, Introduction to Sequencing and Scheduling, John Wiley & Sons, 1974.
Improving the Preemptive Bound for the One-Machine Dynamic.. - Croce, T'kindt (2002) (Correct)
No context found.
Baker K.R. (1974), "Introduction to Sequencing and Scheduling ", John Wiley, New York.
Approximation Algorithms for Average Stretch Scheduling - Bender, Muthukrishnan.. (2003) (Correct)
No context found.
K. R. Baker. Introduction to Sequencing and Scheduling. Wiley, New York, 1974.
Hybrid Method to Optimize Petroleum Extraction in Deep.. - Nascimento, Moura, de.. (2002) (Correct)
No context found.
K. R. Baker. Introduction to sequencing and scheduling. John Wiley and Sons, 1974.
Minimizing Total Flow Time and Total Completion Time with.. - Avrahami, Azar (2003) (2 citations) (Correct)
No context found.
K.R. Baker. Introduction to Sequencing and Scheduling. Wiley, 1974.
Approximating Total Flow Time on Parallel Machines - Leonardi, Raz (1997) (36 citations) (Correct)
No context found.
K.R. Baker. Introduction to Sequencing and Scheduling. Wiley, New York, 1974.
Schedulability Analysis of Real-Time Traffic in.. - Almeida, Tovar.. (2002) (Correct)
No context found.
Baker, K.R. Introduction to Sequencing and Scheduling. John Wiley & Sons, 1974.
Scheduling to Minimize Average Stretch without Migration - Becchetti, Leonardi.. (1999) (9 citations) (Correct)
No context found.
K.R. Baker. Introduction to Sequencing and Scheduling. Wiley, 1974.
New Dynamic Heuristics in the Client-Agent-Server Model - Yves Caniou Loria (Correct)
No context found.
K. Baker. Introduction to Sequencing and Scheduling. 1974.
Focused Simulated Annealing - Search An Application (1994) (Correct)
No context found.
Baker, K.R. "Introduction to Sequencing and Scheduling," Wiley, 1974.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC