Article thumbnail

Note--On the Sequencing of n Jobs on One Machine to Minimize the Number of Jobs Late

By Salah E. Elmaghraby

Abstract

In a recent paper [Moore, J. M. 1968. An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Sci. 15(1, September).] Moore addressed himself to the problem of the title, and devised a rather simple algorithm for its solution. He also mentions a somewhat simpler algorithm suggested by Hodgson. The proof of both algorithms is rather involved. The following is a more direct, and hopefully simpler, proof.

DOI identifier: 10.1287/mnsc.18.7.389
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://dx.doi.org/10.1287/mnsc... (external link)

  • To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

    Suggested articles