Scheduling n jobs on one machine to minimize the maximum tardiness with minimum number
Author:
- J.G. ShanthikumarJSJ.G. Shanthikumar
- 31 December 1983
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 10 (3) , 255-266
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A multiple objective decision theoretic approach to one-machine scheduling problemsComputers & Operations Research, 1980
- Sequencing to Minimize the Maximum Job CostOperations Research, 1980
- Scheduling to minimize the weighted sum of completion times with secondary criteriaNaval Research Logistics Quarterly, 1976
- A note on a scheduling problem with dual criteriaNaval Research Logistics Quarterly, 1975
- One machine sequencing to minimize mean flow time with minimum number tardyNaval Research Logistics Quarterly, 1975
- On Scheduling with Ready Times and Due Dates to Minimize Maximum LatenessOperations Research, 1975
- Sequencing with due‐dates and early start times to minimize maximum tardinessNaval Research Logistics Quarterly, 1974
- A note on the extension of a result on scheduling with secondary criteriaNaval Research Logistics Quarterly, 1972
- Scheduling with earliest start and due date constraintsNaval Research Logistics Quarterly, 1971
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late JobsManagement Science, 1968