Showing papers on "Single-machine scheduling published in 1977"
TL;DR: In this paper, the authors survey and extend the results on the complexity of machine scheduling problems and give a classification of scheduling problems on single, different and identical machines and study the influence of various parameters on their complexity.
Abstract: We survey and extend the results on the complexity of machine scheduling problems. After a brief review of the central concept of NP-completeness we give a classification of scheduling problems on single, different and identical machines and study the influence of various parameters on their complexity. The problems for which a polynomial-bounded algorithm is available are listed and NP-completeness is established for a large number of other machine scheduling problems. We finally discuss some questions that remain unanswered.
1,881 citations
TL;DR: An algorithm is presented for solving a single-machine job shop scheduling problem in which penalties occur for jobs that either commence before their target start times or are completed after their due dates, generalized to cover the case in which the machine is available for only a limited time span.
Abstract: We consider a single-machine job shop scheduling problem in which penalties occur for jobs that either commence before their target start times or are completed after their due dates. The objective is to minimize the maximum penalty, subject to restrictive assumptions on the target start times, the due dates, and the penalty functions. We present an algorithm for solving this problem, along with a method for generating alternative optima. The algorithm is generalized to cover the case in which the machine is available for only a limited time span.
170 citations