One machine sequencing to minimize mean flow time with minimum number tardy
- 1 September 1975
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 22 (3) , 585-592
- https://doi.org/10.1002/nav.3800220314
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A note on a scheduling problem with dual criteriaNaval Research Logistics Quarterly, 1975
- An experimental comparison of solution algorithms for the single‐machine tardiness problemNaval Research Logistics Quarterly, 1974
- An Extension of Moore’s Due Date AlgotithmPublished by Springer Nature ,1973
- A note on the extension of a result on scheduling with secondary criteriaNaval Research Logistics Quarterly, 1972
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late JobsManagement Science, 1968
- Various optimizers for single‐stage productionNaval Research Logistics Quarterly, 1956