Multi-Objective Lot Splitting for a Single Product m-Machine Flowshop Line.

JOSEPH BUKCHIN; MICHAEL MASIN

doi:10.1080/07408170490245487

Multi-Objective Lot Splitting for a Single Product m-Machine Flowshop Line.

JOSEPH BUKCHIN, MICHAEL MASIN

Department of Industrial Engineering

Research output: Contribution to journal › Article › peer-review

Abstract

In this paper, the mean flowtime and the makespan objectives are simultaneously investigated in a single product, m-machine, flowshop system. For this purpose, an efficiency frontier approach is applied and an optimal algorithm for generating all efficient solutions is developed. A comprehensive computational experiment is performed for analyzing the tradeoff between the two objectives and evaluating the proposed algorithm performance. The most-balanced-solution, MinMax, is defined and recommended as a desirable alternative for either the flowtime or the makespan optimal solutions. Results show that when the system is optimized for either the mean flowtime or the makespan, a significant loss in the nonoptimized objective value is observed. On the other hand, adopting the MinMax solution obtains a close to optimal solution in both objectives.

Original language	English
Pages (from-to)	191-202
Number of pages	12
Journal	IIE Transactions (Institute of Industrial Engineers)
Volume	36
Issue number	2
DOIs	https://doi.org/10.1080/07408170490245487
State	Published - 1 Feb 2004

Keywords

ALGORITHMS
PRODUCTION scheduling
OPERATIONS research
MATHEMATICAL programming
PRODUCTION control
JOB shops

Access to Document

10.1080/07408170490245487

Cite this

@article{ce4e3a8dafe94977b27b9ba0007ede55,

title = "Multi-Objective Lot Splitting for a Single Product m-Machine Flowshop Line.",

abstract = "In this paper, the mean flowtime and the makespan objectives are simultaneously investigated in a single product, m-machine, flowshop system. For this purpose, an efficiency frontier approach is applied and an optimal algorithm for generating all efficient solutions is developed. A comprehensive computational experiment is performed for analyzing the tradeoff between the two objectives and evaluating the proposed algorithm performance. The most-balanced-solution, MinMax, is defined and recommended as a desirable alternative for either the flowtime or the makespan optimal solutions. Results show that when the system is optimized for either the mean flowtime or the makespan, a significant loss in the nonoptimized objective value is observed. On the other hand, adopting the MinMax solution obtains a close to optimal solution in both objectives.",

keywords = "ALGORITHMS, PRODUCTION scheduling, OPERATIONS research, MATHEMATICAL programming, PRODUCTION control, JOB shops",

author = "JOSEPH BUKCHIN and MICHAEL MASIN",

note = "Funding Information: The research by the second author was partially supported by Marcus PSU/Technion Exchange Partnership.",

year = "2004",

month = feb,

day = "1",

doi = "10.1080/07408170490245487",

language = "אנגלית",

volume = "36",

pages = "191--202",

journal = "IISE Transactions",

issn = "2472-5854",

publisher = "Taylor and Francis Ltd.",

number = "2",

}

TY - JOUR

T1 - Multi-Objective Lot Splitting for a Single Product m-Machine Flowshop Line.

AU - BUKCHIN, JOSEPH

AU - MASIN, MICHAEL

N1 - Funding Information: The research by the second author was partially supported by Marcus PSU/Technion Exchange Partnership.

PY - 2004/2/1

Y1 - 2004/2/1

N2 - In this paper, the mean flowtime and the makespan objectives are simultaneously investigated in a single product, m-machine, flowshop system. For this purpose, an efficiency frontier approach is applied and an optimal algorithm for generating all efficient solutions is developed. A comprehensive computational experiment is performed for analyzing the tradeoff between the two objectives and evaluating the proposed algorithm performance. The most-balanced-solution, MinMax, is defined and recommended as a desirable alternative for either the flowtime or the makespan optimal solutions. Results show that when the system is optimized for either the mean flowtime or the makespan, a significant loss in the nonoptimized objective value is observed. On the other hand, adopting the MinMax solution obtains a close to optimal solution in both objectives.

AB - In this paper, the mean flowtime and the makespan objectives are simultaneously investigated in a single product, m-machine, flowshop system. For this purpose, an efficiency frontier approach is applied and an optimal algorithm for generating all efficient solutions is developed. A comprehensive computational experiment is performed for analyzing the tradeoff between the two objectives and evaluating the proposed algorithm performance. The most-balanced-solution, MinMax, is defined and recommended as a desirable alternative for either the flowtime or the makespan optimal solutions. Results show that when the system is optimized for either the mean flowtime or the makespan, a significant loss in the nonoptimized objective value is observed. On the other hand, adopting the MinMax solution obtains a close to optimal solution in both objectives.

KW - ALGORITHMS

KW - PRODUCTION scheduling

KW - OPERATIONS research

KW - MATHEMATICAL programming

KW - PRODUCTION control

KW - JOB shops

UR - http://www.scopus.com/inward/record.url?scp=1642461394&partnerID=8YFLogxK

U2 - 10.1080/07408170490245487

DO - 10.1080/07408170490245487

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

SN - 2472-5854

VL - 36

SP - 191

EP - 202

JO - IISE Transactions

JF - IISE Transactions

IS - 2

ER -

Multi-Objective Lot Splitting for a Single Product m-Machine Flowshop Line.

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this