Showing papers by "Chris N. Potts published in 1991"
TL;DR: A collection of heuristics for the single machine total (weighted) tardiness problem are presented and it is indicated that straightforward interchange methods perform remarkably well.
Abstract: This paper presents a collection of heuristics for the single machine total (weighted) tardiness problem. The methods considered range from simple quick and dirty heuristics to more sophisticated algorithms exploiting problem structure. These heuristics are compared to interchange and simulated annealing methods on a large set of test problems. For the total tardiness problem a heuristic based on decomposition performs very well, whereas for the total weighted tardiness problem simulated annealing appears to be a viable approach. Our computational results also indicate that straightforward interchange methods perform remarkably well.
204 citations
TL;DR: It is shown that for the problem of minimizing the maximum completion time, this assumption can be a costly one, by exhibiting a family of instances for which the value of the best permutation schedule is worse than that of the true optimal schedule by a factor of more than 12@/m.
91 citations
TL;DR: Results indicate that the quality of the heuristic schedules is rather unsatisfactory, unless an improvement procedure is included, and a natural and easily implemented method known as the earliest completion time heuristic is considered.
88 citations
TL;DR: An O(n log n) algorithm is proposed which, he claims, minimizes the sum of completion times, but a counter-example is presented which shows it can fail to generate an optimal schedule.
29 citations