Showing papers by "Chris N. Potts published in 1980"
TL;DR: In this paper, a single machine sequencing problem is considered in which each job has a release date, a processing time and a delivery time, and the objective is to find a sequence of jobs which minimizes the time by which all jobs are delivered.
Abstract: The single machine sequencing problem is considered in which each job has a release date, a processing time and a delivery time. The objective is to find a sequence of jobs which minimizes the time by which all jobs are delivered. A heuristic is presented which never deviates by more than 50% from the optimum.
164 citations
TL;DR: In this article, a branch-and-bound algorithm is presented for the permutation flow-shop problem, in which the objective is to minimize the maximum completion time, and a branching procedure is used in which jobs both at the beginning and at the end of the schedule have been fixed.
85 citations