A note on the generalized due dates scheduling problems

C. Sriskandarajah

Naval Research Logistics (NRL), 1990, vol. 37, issue 4, 587-597

Abstract: We consider the problem of scheduling jobs on a single machine with generalized due dates. The due dates are given according to the position in which a job is completed, rather than the identity of that job. The computational complexity question of whether the total weighted tardiness problem can be solved in polynomial time or NP‐hard is posed as an open problem in [4]. We show that this problem is NP‐hard. We also establish NP‐hardness results for the scheduling problems with precedence constraints.

Date: 1990
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199008)37:43.0.CO;2-O

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:wly:navres:v:37:y:1990:i:4:p:587-597

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().