A COMMENT ON A PAPER OF MAXWELL.

Abstract

In a paper 'On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs,' Maxwell presents an integer programming formulation (which is called P) of a one-machine job-shop problem, and attempts to prove the validity of Moore's optimal algorithm by applying cutting plane constraints to the program P. Unfortunately, Maxwell's proof is incorrect. This brief note, locates Maxwell's error, and presents an example which casts doubt on the possibility of minor modifications being sufficient to correct the proof. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1970
Accession Number
AD0709632

Entities

People

  • Jeffrey B. Sidney

Organizations

  • Rice University

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Integer Programming
  • Mathematics

Fields of Study

  • Computer science

Readers

  • Educational Psychology
  • Environmental Impact Assessment (EIA) of Proposed Air Force Base Actions.
  • Operations Research