A Branch-and-Bound Procedure to Solve a Bicriterion Scheduling Problem
- 1 March 1983
- journal article
- research article
- Published by Taylor & Francis in IIE Transactions
- Vol. 15 (1) , 84-88
- https://doi.org/10.1080/05695558308974617
Abstract
Most scheduling research is done with one criterion; however, the real-world situations demand consideration of multicriterion problems because there are generally many costs associated with scheduling decisions. This paper considers the problem of minimizing a linear combination of flow times and max-mum tardiness of a given number of jobs on a single machine and presents a branch-and-bound technique to arrive at an optimal solution. The computational results are also reported.Keywords
This publication has 11 references indexed in Scilit:
- Scheduling of a single machine to minimize total weighted completion time subject to release datesNaval Research Logistics Quarterly, 1982
- Sequencing independent jobs with a single resourceNaval Research Logistics Quarterly, 1980
- The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound SolutionManagement Science, 1978
- A dual algorithm for the one-machine scheduling problemMathematical Programming, 1976
- 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
- A note on the extension of a result on scheduling with secondary criteriaNaval Research Logistics Quarterly, 1972
- M-stage scheduling problem—a critical appraisalInternational Journal of Production Research, 1971
- Various optimizers for single‐stage productionNaval Research Logistics Quarterly, 1956