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 to compare it to other similar allocation problems, among which is the Knapsack problem.

MoreLess

Year of publication:	1970
Authors:	Maxwell, William L.
Published in:	Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 16.1970, 5, p. 295-297
Publisher:	Institute for Operations Research and the Management Sciences - INFORMS

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Extent:	application/pdf
Type of publication:	Article
Other identifiers:	10.1287/mnsc.16.5.295 [DOI]
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10009190233