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

Placeholder

School / College / Institute

Program

KU Authors

Co-Authors

N/A

Publication Date

Language

Embargo Status

Journal Title

Journal ISSN

Volume Title

Alternative Title

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.

Source

Publisher

Elsevier Science Bv

Subject

Management, Operations research, Management science

Citation

Has Part

Source

European Journal of Operational Research

Book Series Title

Edition

DOI

10.1016/S0377-2217(98)00009-5

item.page.datauri

Link

Rights

Copyrights Note

Endorsement

Review

Supplemented By

Referenced By

0

Views

0

Downloads

View PlumX Details