A two-stage flexible flow shop problem with unit-execution-time jobs and batching

Enrique Gerstl; Gur Mosheiov

doi:10.1016/j.ijpe.2014.08.004

A two-stage flexible flow shop problem with unit-execution-time jobs and batching

Enrique Gerstl, Gur Mosheiov^*

^*Corresponding author for this work

Specialization in Operations Research

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

5 Scopus citations

Abstract

We study a batch-scheduling problem of unit-time jobs on a two-stage flexible flowshop. The objective functions are minimum makespan and minimum flowtime. Unlike previously studied models: (i) a general number of machines in both stages of the flowshop is allowed, and (ii) there is no restriction on the number of batches to be processed on each machine. Efficient exact dynamic programming algorithms are introduced. Extensions to the case of machine-dependent setup times are studied as well. All the proposed algorithms run in polynomial time in the number of jobs.

Original language	English
Pages (from-to)	171-178
Number of pages	8
Journal	International Journal of Production Economics
Volume	158
DOIs	https://doi.org/10.1016/j.ijpe.2014.08.004
State	Published - 1 Dec 2014

Bibliographical note

Publisher Copyright:
© 2014 Elsevier B.V. All rights reserved.

Keywords

Batch scheduling
Deterministic scheduling
Flexible flowshop
Makespan

Access to Document

10.1016/j.ijpe.2014.08.004

Cite this

@article{8ec57296eca74ce684657b7f6b6eda23,

title = "A two-stage flexible flow shop problem with unit-execution-time jobs and batching",

abstract = "We study a batch-scheduling problem of unit-time jobs on a two-stage flexible flowshop. The objective functions are minimum makespan and minimum flowtime. Unlike previously studied models: (i) a general number of machines in both stages of the flowshop is allowed, and (ii) there is no restriction on the number of batches to be processed on each machine. Efficient exact dynamic programming algorithms are introduced. Extensions to the case of machine-dependent setup times are studied as well. All the proposed algorithms run in polynomial time in the number of jobs.",

keywords = "Batch scheduling, Deterministic scheduling, Flexible flowshop, Makespan",

author = "Enrique Gerstl and Gur Mosheiov",

year = "2014",

month = dec,

day = "1",

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

language = "אנגלית",

volume = "158",

pages = "171--178",

journal = "International Journal of Production Economics",

issn = "0925-5273",

publisher = "Elsevier",

}

TY - JOUR

T1 - A two-stage flexible flow shop problem with unit-execution-time jobs and batching

AU - Gerstl, Enrique

AU - Mosheiov, Gur

PY - 2014/12/1

Y1 - 2014/12/1

N2 - We study a batch-scheduling problem of unit-time jobs on a two-stage flexible flowshop. The objective functions are minimum makespan and minimum flowtime. Unlike previously studied models: (i) a general number of machines in both stages of the flowshop is allowed, and (ii) there is no restriction on the number of batches to be processed on each machine. Efficient exact dynamic programming algorithms are introduced. Extensions to the case of machine-dependent setup times are studied as well. All the proposed algorithms run in polynomial time in the number of jobs.

AB - We study a batch-scheduling problem of unit-time jobs on a two-stage flexible flowshop. The objective functions are minimum makespan and minimum flowtime. Unlike previously studied models: (i) a general number of machines in both stages of the flowshop is allowed, and (ii) there is no restriction on the number of batches to be processed on each machine. Efficient exact dynamic programming algorithms are introduced. Extensions to the case of machine-dependent setup times are studied as well. All the proposed algorithms run in polynomial time in the number of jobs.

KW - Batch scheduling

KW - Deterministic scheduling

KW - Flexible flowshop

KW - Makespan

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

U2 - 10.1016/j.ijpe.2014.08.004

DO - 10.1016/j.ijpe.2014.08.004

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

AN - SCOPUS:84913587266

SN - 0925-5273

VL - 158

SP - 171

EP - 178

JO - International Journal of Production Economics

JF - International Journal of Production Economics

ER -

A two-stage flexible flow shop problem with unit-execution-time jobs and batching

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this