A bicriteria approach to the two-machine flow shop scheduling problem

In this paper we address the problem of minimizing makespan and sum of completion times simultaneously in a two-machine flow shop environment. We formulate the problem as a bicriteria scheduling problem, and develop a branch-and-bound procedure that iteratively solves restricted single objective scheduling problems until the set of efficient solutions is completely enumerated. We report computational results, and explore certain properties of the set of efficient solutions. We then discuss their implications for the Decision Maker. (C) 1999 Elsevier Science B.V. All rights reserved.