An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- 1 September 1968
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 15 (1) , 102-109
- https://doi.org/10.1287/mnsc.15.1.102
Abstract
An algorithm, computationally feasible for large problems, has been formulated for sequencing n jobs through a single facility to minimize the number of late jobs. This algorithm is then extended to solve the problem in which each job is associated with a continuous, monotone non-decreasing deferral cost function. The object is to produce a schedule where the maximum deferral cost incurred is minimal.Keywords
This publication has 0 references indexed in Scilit: