Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
Authors:
- 28 December 1999
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 17 (5) , 205-208
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penaltyComputers & Operations Research, 1989
- Bicriterion static scheduling research for a single machineOmega, 1988
- Scheduling with Multiple Performance Measures: The One-Machine CaseManagement Science, 1986
- A Branch-and-Bound Procedure to Solve a Bicriterion Scheduling ProblemIIE Transactions, 1983
- Solving a bicriterion scheduling problemEuropean Journal of Operational Research, 1980
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- A note on a scheduling problem with dual criteriaNaval Research Logistics Quarterly, 1975
- Optimal Sequencing of a Single Machine Subject to Precedence ConstraintsManagement Science, 1973
- Various optimizers for single‐stage productionNaval Research Logistics Quarterly, 1956