Scholion.ai

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

Tapan Sen, Farhad M. E. Raiszadeh, Parthasarati Dileepan

Management Science · 1988 · Volume 34 · Issue 2

DOI: 10.1287/mnsc.34.2.254

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.

Keywords

production/scheduling: job shop, deterministic, decision analysis: criteria, programming: multiple criteria

Enable JavaScript for citation tools and additional paper interactions.