Topic

# Tardiness

About: Tardiness is a research topic. Over the lifetime, 4462 publications have been published within this topic receiving 94123 citations. The topic is also known as: chronic lateness.

##### Papers published on a yearly basis

##### Papers

More filters

••

[...]

TL;DR: A framework to show how results have been generalized starting with a basic model that contains symmetric penalties, one machine and a common due date is provided and such features as parallel machines, complex penalty functions and distinct due dates are added.

Abstract: We consider the problem of scheduling n jobs to minimize the total earliness and tardiness penalty. We review the literature on this topic, providing a framework to show how results have been generalized starting with a basic model that contains symmetric penalties, one machine and a common due date. To this base we add such features as parallel machines, complex penalty functions and distinct due dates. We also consolidate many of the existing results by proving general forms of two key properties of earliness/tardiness models.

960 citations

••

[...]

TL;DR: The problem of minimizing the total tardiness for a set of independent jobs on one machine is considered and is shown to be NP-hard in the ordinary sense.

Abstract: The problem of minimizing the total tardiness for a set of independent jobs on one machine is considered. Lawler has given a pseudo-polynomial-time algorithm to solve this problem. In spite of extensive research efforts for more than a decade, the question of whether it can be solved in polynomial time or it is NP-hard in the ordinary sense remained open. In this paper the problem is shown to be NP-hard in the ordinary sense.

682 citations

••

[...]

TL;DR: In this paper, the authors consider the case where n jobs are to be processed by a single machine, and assume that the weighting of jobs is "agreeable", in the sense that the tardiness of a job in a given sequence is wj, max (O, Ci, - di), where Ci is the completion time of job j.

Abstract: Suppose n jobs are to be processed by a single machine. Associated with each job j are a fixed integer processing time pi, a due date di, and a positive weight wj. The weighted tardiness of job j in a given sequence is wj, max (O, Ci, - di), where Ci is the completion time of job j. Assume that the weighting of jobs is “agreeable”, in the sense that pi

604 citations

••

[...]

TL;DR: The results indicate that the new rules are not only superior to competing rules for minimizing weighted tardiness penalties but are also robust for several other criteria, such as the number of tardy jobs and the costs of in-process inventories.

Abstract: Mainstream research in priority dispatching has considered jobs with equal delay penalties, thereby ruling out strategic differentiation of customer orders. We develop and test efficient dispatchin...

519 citations