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

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

0.00 Avg rating0 Votes
Article ID: iaor20001511
Country: Netherlands
Volume: 113
Issue: 2
Start Page Number: 435
End Page Number: 449
Publication Date: Mar 1999
Journal: European Journal of Operational Research
Authors: ,
Keywords: decision theory: multiple criteria
Abstract:

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.

Reviews

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