A Comment on a Paper of Maxwell

Jeffrey B. Sidney
Additional contact information
Jeffrey B. Sidney: The University of British Columbia

Management Science, 1972, vol. 18, issue 11, 716-717

Abstract: In his paper "On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs," [Maxwell, W. L. 1970. On sequencing n jobs on one machine to minimize the number of late jobs. Management Sci. 16(5, January).], Maxwell presents an integer programming formulation (which we shall call P) of a one-machine job-shop problem, and attempts to prove the validity of Moore's optimal algorithm [Moore, J. M. 1908. An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Sci. 15(1, September).] by applying cutting plane constraints to the program P. Unfortunately, Maxwell's proof is incorrect. In this brief note, we shall locate Maxwell's error, and present an example, which casts doubt on the possibility of minor modifications being sufficient to correct the proof. We shall adopt much of the notation of Maxwell's paper.

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.18.11.716 (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:18:y:1972:i:11:p:716-717

Access Statistics for this article

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