A branch-and-bound approach to solve a bicriterion scheduling problem involving squared flowtime and maximum tardiness

A branch-and-bound approach to solve a bicriterion scheduling problem involving squared flowtime and maximum tardiness

0.00 Avg rating0 Votes
Article ID: iaor1995141
Country: India
Volume: 15
Issue: 2
Start Page Number: 267
End Page Number: 277
Publication Date: May 1994
Journal: Journal of Information & Optimization Sciences
Authors: ,
Keywords: programming: multiple criteria, programming: branch and bound
Abstract:

This paper considers a bicriterion scheduling problem in which a linear combination of two objective functions is considered. The weights are used to represent the relative importance of the two criteria, i.e., squared flowtime and maximum tardiness. A branch-and-bound solution procedure is deisgned for the problem, and a numerical example is provided to illustrate the procedure.

Reviews

Required fields are marked *. Your email address will not be published.