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

Publisher Website
Google Scholar
Abstract
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.production/scheduling: job shop, deterministic, decision analysis: criteria, programming: multiple criteria

This publication has 0 references indexed in Scilit: