Showing papers on "Single-machine scheduling published in 1983"
TL;DR: In this paper, a solution algorithm for a single machine scheduling problem with two criteria: total tardiness and total flow time is presented, which is then incorporated into a multiple-criteria dynamic programming framework to improve the computational efficiency.
Abstract: This paper presents a solution algorithm for a single machine scheduling problem with two criteria: total tardiness and total flow time. Theoretical results of precedence properties which are respected by all nondominated schedules are first derived. These precedence properties are then incorporated into a multiple-criteria dynamic programming framework to improve the computational efficiency. Results of the computational experiment and the average behavior (computation time and efficiency) of the algorithm are reported.
34 citations
TL;DR: In this article, the authors gave an O(n log n log 3n) time algorithm for the chance-constrained sequencing problem on a single machine, where n is the number of jobs and the objective is to minimize the number which are early with probability not smaller than a given constant against the common due time d.
17 citations