The single-machine scheduling problem to minimize total tardiness subject to minimum number of tardy jobs
Authors:
- George L. VairaktarakisGVGeorge L. Vairaktarakis
- Chung-Yee LeeCLChung-Yee Lee
- 27 April 1995
- journal article
- Published by Taylor & Francis in IIE Transactions
- Vol. 27 (2) , 250-256
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Minimizing Total Tardiness on One Machine is NP-HardMathematics of Operations Research, 1990
- A survey of algorithms for the single machine total weighted tardiness scheduling problemDiscrete Applied Mathematics, 1990
- A Branch and Bound Algorithm for the Total Weighted Tardiness ProblemOperations Research, 1985
- Scheduling n jobs on one machine to minimize the maximum tardiness with minimum numberComputers & Operations Research, 1983
- One machine sequencing to minimize mean flow time with minimum number tardyNaval Research Logistics Quarterly, 1975
- An Extension of Moore’s Due Date Algotithm1973
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late JobsManagement Science, 1968