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

An integer programming formulation for the problem of sequencing jobs on a single machine to minimize the number of late jobs is developed. The structure of the formulation is exploited to obtain the easily stated algorithm (previously developed by Moore [5]) for the solution of the problem and then...

Full description

Saved in:
Bibliographic Details
Published inManagement science Vol. 16; no. 5; pp. 295 - 297
Main Author Maxwell, William L
Format Journal Article
LanguageEnglish
Published Hanover, MD., etc INFORMS 01.01.1970
Institute of Management Sciences
Institute for Operations Research and the Management Sciences
SeriesManagement Science
Subjects
Algorithms
Integer programming
Job shops
Knapsack problem
Management science
Objective functions
Sequencing
Online AccessGet full text

Cover

More Information
Summary:An integer programming formulation for the problem of sequencing jobs on a single machine to minimize the number of late jobs is developed. The structure of the formulation is exploited to obtain the easily stated algorithm (previously developed by Moore [5]) for the solution of the problem and then to compare it to other similar allocation problems, among which is the Knapsack problem.
ISSN:0025-1909
1526-5501
DOI:10.1287/mnsc.16.5.295