Note--A Note on Shwimer's Theorem A

Werner Dinkelbach and Otto Rosenberg
Additional contact information
Werner Dinkelbach: University of Saarland
Otto Rosenberg: University of Saarland

Management Science, 1977, vol. 23, issue 6, 660-661

Abstract: In 1972 Joel Shwimer published some interesting research "on the n-job, one-machine, sequence-independent scheduling problem with tardiness penalties ... where the goal is to minimize the total penalty costs resulting from the tardiness of the jobs" (Shwimer, J. 1972. On the n-job, one-machine, sequence-independent scheduling problem with tardiness penalties: a branch-bound solution. Management Sci. 18 (6) B301-B313.). The proposed algorithm is essentially based on his Theorem A. Unfortunately the given proof of Theorem A contains an inconsistency. In this note we present a different proof of the mentioned theorem.

Date: 1977
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.23.6.660 (application/pdf)

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:inm:ormnsc:v:23:y:1977:i:6:p:660-661

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().