Showing papers on "Tardiness published in 1982"
TL;DR: The problem of sequencing jobs on a single machine to minimize total tardiness is considered and an algorithm, which decomposes the problem into subproblems which are then solved by dynamic programming when they are sufficiently small.
306 citations
TL;DR: This work investigates priority rules aimed at minimizing tardiness, emphasizing a “modified duedate rule” which functions effectively in conjunction with internally-set deadlines and which adapts to both tight and loose conditions in the due-dates.
213 citations
TL;DR: A fully polynomial approximation scheme is presented for the problem of sequencing jobs for processing by a single machine so as to minimize total tardiness.
77 citations
TL;DR: Results of the simulation study of the relative impact of different operating policies on performance of a hypothetical multistage production system that produces assembled products indicate that much previous research in non-assembly systems can be generalized to assembly systems.
Abstract: This paper describes a simulation study of the relative impact of different operating policies on performance of a hypothetical multistage production system that produces assembled products. The main objective of this study is to examine the impact of operating policy rules on system performance. Several performance criteria, including flow time and earliness and tardiness measures, were used to evaluate system performance. Results show that performance of the production system is significantly influenced by the operating policy rules, although the relative impact of the rules is dependent on the performance measure considered. Interactions between and among policy rules were also found to be important in several cases. Overall, the results indicate that much previous research in non-assembly systems can be generalized to assembly systems.
Subject Areas: Scheduling, Material Requirements Planning, and Simulation.
44 citations
01 Apr 1982
TL;DR: A characterization of the optimal solution for the weighed tardiness problem is derived which is analogues to its counterpart in the single machine case and how this characterization may be used to develop heuristics for flowshop problems is indicated.
Abstract: : It is well known that except in the case of makespan problems, there are hardly and analytical results for flowshop problems. This paper considers of a class of flowshop problems where jobs processing time at a machine is proportionate to the processing time on the first machine. The authors show that for the pre-emptive version of the problem, in order to minimize and regular measure of performance, it is sufficient to consider permutation schedules. Also, results for various other measure are derived. A characterization of the optimal solution for the weighed tardiness problem is derived which is analogues to its counterpart in the single machine case. It is indicated as how this characterization may be used to develop heuristics for flowshop problems.
5 citations
28 Feb 1982
2 citations
TL;DR: In this article, the authors consider the problem of scheduling two or more independent projects against a single resource, whose availability may vary over time, so as to minimize the total penalty for project tardiness.
Abstract: In this paper we consider a problem of scheduling two or more independent projects against a single resource, whose availability may vary over time, so as to minimize the total penalty for project tardiness. A simple heuristic is proposed and a bound on its worst case performance is determined.
1 citations