Showing papers by "Chris N. Potts published in 2000"
TL;DR: This paper reviews the literature on scheduling with batching, giving details of the basic algorithms, and referencing other significant results about efficient dynamic programming algorithms for solving batching problems.
904 citations
TL;DR: This paper considers the nonpreemptive scheduling of a given set of jobs on several identical, parallel machines, under a variety of assumptions about setup and processing times, and provides a mapping of the computational complexity of these problems.
124 citations
TL;DR: It is proved that the shortest remaining processing time (SRPT) rule yields an on-line algorithm with competitive ratio 12.
57 citations
TL;DR: This paper examines the scheduling of jobs, each of which comprises a standard and a specific component, on a single machine and shows that a variant of the number of late jobs problem, in which a common processing time for the standard components is solvable in O (n 4 log n) time.
24 citations
TL;DR: A heuristic algorithm for scheduling jobs in two-machine no-wait flow shops for which the objective is to minimize the makespan is proposed, and its worst-case performance ratio of 4/3 is established.
21 citations
01 Jan 2000
TL;DR: It is proved that the shortest remaining processing time (SRPT) rule yields an on-line algorithm with competitive ratio 1 and it is shown that there does not exist an on line algorithm with a better performance guarantee.
Abstract: This note deals with the scheduling problem of maximizing the number of early jobs on a single machine We investigate the on-line version of this problem in the Preemption-Restart model This means that jobs may be preempted, but preempting results in all the work done on this job so far being lost Thus, if the job is restarted, then it has to be done from scratch We prove that the shortest remaining processing time (SRPT) rule yields an on-line algorithm with competitive ratio 1 Moreover, we show that there does not exist an on-line algorithm with a better performance guarantee c 2000 Elsevier Science BV All rights reserved