Batch scheduling in a two-stage flexible flow shop problem

Enrique Gerstl; Gur Mosheiov; Assaf Sarig

doi:10.2478/fcds-2014-0001

Batch scheduling in a two-stage flexible flow shop problem

Enrique Gerstl, Gur Mosheiov, Assaf Sarig

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

14 Scopus citations

Abstract

We study a special two-stage flexible flowshop, which consists of several parallel identical machines in the first stage and a single machine in the second stage. We assume identical jobs, and the option of batching, with a required setup time prior to the processing of a new batch. We also consider the option to use only a subset of the available machines. The objective is minimum makespan. A unique optimal solution is introduced, containing the optimal number of machines to be used, the sequence of batch sizes, and the batch schedule. The running time of our proposed solution algorithm is independent of the number of jobs, and linear in the number of machines.

Original language	English
Pages (from-to)	3-16
Number of pages	14
Journal	Foundations of Computing and Decision Sciences
Volume	39
Issue number	1
DOIs	https://doi.org/10.2478/fcds-2014-0001
State	Published - Feb 2014

Bibliographical note

Funding Information:
A flexible flowshop is a machine setting consisting of several stages in series, where each stage contains a number of parallel machines. Minimizing makespan on a general flexible flowshop is clearly NP-hard, since it is a generalization of both minimum makespan on parallel identical machines and minimum makespan on a classical flowshop (with at least three machines). In fact, minimum makespan on a flexible flowshop was shown to be strongly NP-hard even for the special case of () two stages, () two identical machines in one stage and a single machine in the second stage, and () when preemption is allowed (Hoogeveen et al. [11]). We refer the reader to the recent survey on flexible flowshops by * Enrique Gerstl, School of Business Administration, The Hebrew University, Jerusalem, Israel; Gur Mosheiov, School of Business Administration, The Hebrew University, Jerusalem, Israel. ** Assaf Sarig, The Center for Academics Studies, Or Yehuda, Israel Acknowledgement: This paper was supported in part by The Recanati Fund and The Charles Rosen Chair of Management, The School of Business Administration, The Hebrew University, Jerusalem, Israel.

Keywords

Batch Scheduling
Deterministic Scheduling
Flexible Flowshop

Access to Document

10.2478/fcds-2014-0001

Cite this

@article{1e2a2041064246c19ffcce0c90e106c3,

title = "Batch scheduling in a two-stage flexible flow shop problem",

abstract = "We study a special two-stage flexible flowshop, which consists of several parallel identical machines in the first stage and a single machine in the second stage. We assume identical jobs, and the option of batching, with a required setup time prior to the processing of a new batch. We also consider the option to use only a subset of the available machines. The objective is minimum makespan. A unique optimal solution is introduced, containing the optimal number of machines to be used, the sequence of batch sizes, and the batch schedule. The running time of our proposed solution algorithm is independent of the number of jobs, and linear in the number of machines.",

keywords = "Batch Scheduling, Deterministic Scheduling, Flexible Flowshop",

author = "Enrique Gerstl and Gur Mosheiov and Assaf Sarig",

note = "Funding Information: A flexible flowshop is a machine setting consisting of several stages in series, where each stage contains a number of parallel machines. Minimizing makespan on a general flexible flowshop is clearly NP-hard, since it is a generalization of both minimum makespan on parallel identical machines and minimum makespan on a classical flowshop (with at least three machines). In fact, minimum makespan on a flexible flowshop was shown to be strongly NP-hard even for the special case of () two stages, () two identical machines in one stage and a single machine in the second stage, and () when preemption is allowed (Hoogeveen et al. [11]). We refer the reader to the recent survey on flexible flowshops by * Enrique Gerstl, School of Business Administration, The Hebrew University, Jerusalem, Israel; Gur Mosheiov, School of Business Administration, The Hebrew University, Jerusalem, Israel. ** Assaf Sarig, The Center for Academics Studies, Or Yehuda, Israel Acknowledgement: This paper was supported in part by The Recanati Fund and The Charles Rosen Chair of Management, The School of Business Administration, The Hebrew University, Jerusalem, Israel.",

year = "2014",

month = feb,

doi = "10.2478/fcds-2014-0001",

language = "אנגלית",

volume = "39",

pages = "3--16",

journal = "Foundations of Computing and Decision Sciences",

issn = "0867-6356",

publisher = "Walter de Gruyter GmbH",

number = "1",

}

TY - JOUR

T1 - Batch scheduling in a two-stage flexible flow shop problem

AU - Gerstl, Enrique

AU - Mosheiov, Gur

AU - Sarig, Assaf

N1 - Funding Information: A flexible flowshop is a machine setting consisting of several stages in series, where each stage contains a number of parallel machines. Minimizing makespan on a general flexible flowshop is clearly NP-hard, since it is a generalization of both minimum makespan on parallel identical machines and minimum makespan on a classical flowshop (with at least three machines). In fact, minimum makespan on a flexible flowshop was shown to be strongly NP-hard even for the special case of () two stages, () two identical machines in one stage and a single machine in the second stage, and () when preemption is allowed (Hoogeveen et al. [11]). We refer the reader to the recent survey on flexible flowshops by * Enrique Gerstl, School of Business Administration, The Hebrew University, Jerusalem, Israel; Gur Mosheiov, School of Business Administration, The Hebrew University, Jerusalem, Israel. ** Assaf Sarig, The Center for Academics Studies, Or Yehuda, Israel Acknowledgement: This paper was supported in part by The Recanati Fund and The Charles Rosen Chair of Management, The School of Business Administration, The Hebrew University, Jerusalem, Israel.

PY - 2014/2

Y1 - 2014/2

N2 - We study a special two-stage flexible flowshop, which consists of several parallel identical machines in the first stage and a single machine in the second stage. We assume identical jobs, and the option of batching, with a required setup time prior to the processing of a new batch. We also consider the option to use only a subset of the available machines. The objective is minimum makespan. A unique optimal solution is introduced, containing the optimal number of machines to be used, the sequence of batch sizes, and the batch schedule. The running time of our proposed solution algorithm is independent of the number of jobs, and linear in the number of machines.

AB - We study a special two-stage flexible flowshop, which consists of several parallel identical machines in the first stage and a single machine in the second stage. We assume identical jobs, and the option of batching, with a required setup time prior to the processing of a new batch. We also consider the option to use only a subset of the available machines. The objective is minimum makespan. A unique optimal solution is introduced, containing the optimal number of machines to be used, the sequence of batch sizes, and the batch schedule. The running time of our proposed solution algorithm is independent of the number of jobs, and linear in the number of machines.

KW - Batch Scheduling

KW - Deterministic Scheduling

KW - Flexible Flowshop

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

U2 - 10.2478/fcds-2014-0001

DO - 10.2478/fcds-2014-0001

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

AN - SCOPUS:84900794932

SN - 0867-6356

VL - 39

SP - 3

EP - 16

JO - Foundations of Computing and Decision Sciences

JF - Foundations of Computing and Decision Sciences

IS - 1

ER -

Batch scheduling in a two-stage flexible flow shop problem

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this