Single machine scheduling: A comparison of two solution procedures
- 1 January 1987
- Vol. 15 (4) , 277-282
- https://doi.org/10.1016/0305-0483(87)90015-6
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A Branch-and-Bound Procedure to Solve a Bicriterion Scheduling ProblemIIE Transactions, 1983
- Solving a bicriterion scheduling problemEuropean Journal of Operational Research, 1980
- Four solution techniques for a general one machine scheduling problem: A comparative studyEuropean Journal of Operational Research, 1978
- 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
- Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. TheoryOperations Research, 1974
- A note on the extension of a result on scheduling with secondary criteriaNaval Research Logistics Quarterly, 1972
- Various optimizers for single‐stage productionNaval Research Logistics Quarterly, 1956