A unified solution approach for the due date assignment problem with tardy jobs

Christos Koulamas

International Journal of Production Economics, 2011, vol. 132, issue 2, 292-295

Abstract: We analyze a number of due date assignment problems with the weighted number of tardy jobs objective and show that these problems can be solved in O(n2) time by dynamic programming. We show that the effects of learning or the effects of past-sequence-dependent setup times can be incorporated into the problem formulation at no additional computational cost. We also show that some single-machine due date assignment problems can be extended to an identical parallel machine setting. Finally, we improve the complexity of the solution algorithms for two other due date assignment problems.

Keywords: Weighted; number; of; tardy; jobs; Due; date; assignment (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925527311001988
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:proeco:v:132:y:2011:i:2:p:292-295

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().