The optimal number of used machines in a two-stage flexible flowshop scheduling problem

Enrique Gerstl; Gur Mosheiov

doi:10.1007/s10951-013-0343-z

The optimal number of used machines in a two-stage flexible flowshop scheduling problem

Enrique Gerstl, Gur Mosheiov^*

^*Corresponding author for this work

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

12 Scopus citations

Abstract

We study practical scheduling problems with a major decision referring to the number of machines to be used. We focus on a two-stage flexible flowshop, where each job is processed on the first (critical) machine, and then continues to one of the second-stage parallel machines. Jobs are assumed to have identical processing times, and are processed in batches. A setup time is required when starting a new batch. We consider two objective functions: minimum makespan and minimum flowtime. In both cases, a closed form expression for the optimal number of machines to be used is introduced, and a unique and unusual sequence of decreasing batch sizes is shown to be optimal.

Original language	English
Pages (from-to)	199-210
Number of pages	12
Journal	Journal of Scheduling
Volume	17
Issue number	2
DOIs	https://doi.org/10.1007/s10951-013-0343-z
State	Published - Apr 2014

Bibliographical note

Funding Information:
Acknowledgments This paper was supported in part by The Recanati Found of the School of Business Administration, and by The Charles Rosen Chair of Management, The Hebrew University, Jerusalem, Israel.

Keywords

Deterministic
Flowshop
Flowtime
Makespan
Scheduling
Sequencing

Access to Document

10.1007/s10951-013-0343-z

Cite this

@article{b206a9c971c44c5e9f57044cacfaa751,

title = "The optimal number of used machines in a two-stage flexible flowshop scheduling problem",

abstract = "We study practical scheduling problems with a major decision referring to the number of machines to be used. We focus on a two-stage flexible flowshop, where each job is processed on the first (critical) machine, and then continues to one of the second-stage parallel machines. Jobs are assumed to have identical processing times, and are processed in batches. A setup time is required when starting a new batch. We consider two objective functions: minimum makespan and minimum flowtime. In both cases, a closed form expression for the optimal number of machines to be used is introduced, and a unique and unusual sequence of decreasing batch sizes is shown to be optimal.",

keywords = "Deterministic, Flowshop, Flowtime, Makespan, Scheduling, Sequencing",

author = "Enrique Gerstl and Gur Mosheiov",

note = "Funding Information: Acknowledgments This paper was supported in part by The Recanati Found of the School of Business Administration, and by The Charles Rosen Chair of Management, The Hebrew University, Jerusalem, Israel.",

year = "2014",

month = apr,

doi = "10.1007/s10951-013-0343-z",

language = "אנגלית",

volume = "17",

pages = "199--210",

journal = "Journal of Scheduling",

issn = "1094-6136",

publisher = "Springer New York",

number = "2",

}

TY - JOUR

T1 - The optimal number of used machines in a two-stage flexible flowshop scheduling problem

AU - Gerstl, Enrique

AU - Mosheiov, Gur

N1 - Funding Information: Acknowledgments This paper was supported in part by The Recanati Found of the School of Business Administration, and by The Charles Rosen Chair of Management, The Hebrew University, Jerusalem, Israel.

PY - 2014/4

Y1 - 2014/4

N2 - We study practical scheduling problems with a major decision referring to the number of machines to be used. We focus on a two-stage flexible flowshop, where each job is processed on the first (critical) machine, and then continues to one of the second-stage parallel machines. Jobs are assumed to have identical processing times, and are processed in batches. A setup time is required when starting a new batch. We consider two objective functions: minimum makespan and minimum flowtime. In both cases, a closed form expression for the optimal number of machines to be used is introduced, and a unique and unusual sequence of decreasing batch sizes is shown to be optimal.

AB - We study practical scheduling problems with a major decision referring to the number of machines to be used. We focus on a two-stage flexible flowshop, where each job is processed on the first (critical) machine, and then continues to one of the second-stage parallel machines. Jobs are assumed to have identical processing times, and are processed in batches. A setup time is required when starting a new batch. We consider two objective functions: minimum makespan and minimum flowtime. In both cases, a closed form expression for the optimal number of machines to be used is introduced, and a unique and unusual sequence of decreasing batch sizes is shown to be optimal.

KW - Deterministic

KW - Flowshop

KW - Flowtime

KW - Makespan

KW - Scheduling

KW - Sequencing

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

U2 - 10.1007/s10951-013-0343-z

DO - 10.1007/s10951-013-0343-z

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

AN - SCOPUS:84894677889

SN - 1094-6136

VL - 17

SP - 199

EP - 210

JO - Journal of Scheduling

JF - Journal of Scheduling

IS - 2

ER -

The optimal number of used machines in a two-stage flexible flowshop scheduling problem

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this