A faster algorithm for a due date assignment problem with tardy jobs

Authors:
Christos Koulamas
Affiliations:
Department of Decision Sciences and Information Systems, Florida International University, Miami, FL 33199, United States
Venue:
Operations Research Letters
Year:
2010

Citing 2
Cited 1

Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine

Manufacturing & Service Operations Management
Two due date assignment problems in scheduling a single machine

Operations Research Letters

A survey on offline scheduling with rejection

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

The single-machine due date assignment problem with the weighted number of tardy jobs objective, (the TWNTD problem), and its generalization with resource allocation decisions and controllable job processing times have been solved in O(n^4) time by formulating and solving a series of assignment problems. In this note, a faster O(n^2) dynamic programming algorithm is proposed for the TWNTD problem and for its controllable processing times generalization in the case of a convex resource consumption function.