A two-stage flow shop batch-scheduling problem with the option of using Not-All-Machines

Enrique Gerstl; Gur Mosheiov

doi:10.1016/j.ijpe.2013.06.018

A two-stage flow shop batch-scheduling problem with the option of using Not-All-Machines

Enrique Gerstl, Gur Mosheiov^*

^*Corresponding author for this work

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

11 Scopus citations

Abstract

The decision whether to use all the available machines in the shop becomes very relevant when the capacity exceeds the demand. In such cases, it might be optimal to use only a subset of the machines. We study this option in a two-stage flowshop environment. Jobs are assumed to be identical, and are processed in batches, where a machine-dependent setup time is required when starting a new batch. The objective function is minimum makespan. We introduce an exact efficient dynamic programming algorithm, which is shown numerically to be able to solve medium size instances in very reasonable time. For the solution of large instances, we propose an asymptotically optimal heuristic procedure and a lower bound on the makespan value, which produce extremely small optimality gaps.

Original language	English
Pages (from-to)	161-166
Number of pages	6
Journal	International Journal of Production Economics
Volume	146
Issue number	1
DOIs	https://doi.org/10.1016/j.ijpe.2013.06.018
State	Published - Nov 2013

Bibliographical note

Funding Information:
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

Dynamic programming
Flowshop
Heuristic
Makespan
Not-All-Machines
Scheduling

Access to Document

10.1016/j.ijpe.2013.06.018

Cite this

@article{5c9b302b96764890a4f20253fa19d37a,

title = "A two-stage flow shop batch-scheduling problem with the option of using Not-All-Machines",

abstract = "The decision whether to use all the available machines in the shop becomes very relevant when the capacity exceeds the demand. In such cases, it might be optimal to use only a subset of the machines. We study this option in a two-stage flowshop environment. Jobs are assumed to be identical, and are processed in batches, where a machine-dependent setup time is required when starting a new batch. The objective function is minimum makespan. We introduce an exact efficient dynamic programming algorithm, which is shown numerically to be able to solve medium size instances in very reasonable time. For the solution of large instances, we propose an asymptotically optimal heuristic procedure and a lower bound on the makespan value, which produce extremely small optimality gaps.",

keywords = "Dynamic programming, Flowshop, Heuristic, Makespan, Not-All-Machines, Scheduling",

author = "Enrique Gerstl and Gur Mosheiov",

note = "Funding Information: 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 = "2013",

month = nov,

doi = "10.1016/j.ijpe.2013.06.018",

language = "אנגלית",

volume = "146",

pages = "161--166",

journal = "International Journal of Production Economics",

issn = "0925-5273",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - A two-stage flow shop batch-scheduling problem with the option of using Not-All-Machines

AU - Gerstl, Enrique

AU - Mosheiov, Gur

N1 - Funding Information: 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 - 2013/11

Y1 - 2013/11

N2 - The decision whether to use all the available machines in the shop becomes very relevant when the capacity exceeds the demand. In such cases, it might be optimal to use only a subset of the machines. We study this option in a two-stage flowshop environment. Jobs are assumed to be identical, and are processed in batches, where a machine-dependent setup time is required when starting a new batch. The objective function is minimum makespan. We introduce an exact efficient dynamic programming algorithm, which is shown numerically to be able to solve medium size instances in very reasonable time. For the solution of large instances, we propose an asymptotically optimal heuristic procedure and a lower bound on the makespan value, which produce extremely small optimality gaps.

AB - The decision whether to use all the available machines in the shop becomes very relevant when the capacity exceeds the demand. In such cases, it might be optimal to use only a subset of the machines. We study this option in a two-stage flowshop environment. Jobs are assumed to be identical, and are processed in batches, where a machine-dependent setup time is required when starting a new batch. The objective function is minimum makespan. We introduce an exact efficient dynamic programming algorithm, which is shown numerically to be able to solve medium size instances in very reasonable time. For the solution of large instances, we propose an asymptotically optimal heuristic procedure and a lower bound on the makespan value, which produce extremely small optimality gaps.

KW - Dynamic programming

KW - Flowshop

KW - Heuristic

KW - Makespan

KW - Not-All-Machines

KW - Scheduling

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

U2 - 10.1016/j.ijpe.2013.06.018

DO - 10.1016/j.ijpe.2013.06.018

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

AN - SCOPUS:84885186223

SN - 0925-5273

VL - 146

SP - 161

EP - 166

JO - International Journal of Production Economics

JF - International Journal of Production Economics

IS - 1

ER -

A two-stage flow shop batch-scheduling problem with the option of using Not-All-Machines

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this