Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness

This paper considers a bicriterion scheduling problem where a linear combination of two objective functions is considered, with weighting factors used to represent relative importance of the two criteria, i.e., total flowtime and range of lateness. A branch-and-bound solution procedure is designed for the problem. Computational results are also reported.

• 저널Management Science · 34(2) · 254–260
• 토픽Scheduling and Optimization Algorithms · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.34.2.254
• 저자Tapan Sen, Farhad M. E. Raiszadeh, Parthasarati Dileepan