Scheduling with earliness and tardiness penalties

Michael C. Ferris and Milan Vlach

Naval Research Logistics (NRL), 1992, vol. 39, issue 2, 229-245

Abstract: We show that the deterministic nonpreemptive scheduling problem with earliness and tardiness penalties can be solved in polynomial time for certain forms of an objective function provided that a certain optimization problem can be solved. We give instances where this problem has a solution and show that this generalizes several results from the literature. These results do not require symmetric penalization and the penalty functions need only be lower semicontinuous.

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

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199203)39:23.0.CO;2-Z

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:39:y:1992:i:2:p:229-245

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 ().