A note: on the two-stage flowshop with dedicated machines to minimize total load

Alessandro Agnetis; Gur Mosheiov

doi:10.1007/s11590-025-02188-3

A note: on the two-stage flowshop with dedicated machines to minimize total load

Alessandro Agnetis, Gur Mosheiov^*

^*Corresponding author for this work

BA Business Department

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

Abstract

We study scheduling problems on a two-stage flowshop, where stage 1 consists of a single (critical) machine and there are a number of parallel dedicated machines in stage 2. The scheduling measure considered is minimum total load. Related measures such as total weighted load, total completion time and total weighted completion time, are also studied. Under a common assumption for this machine setting (of block processing on the critical machine), all these problems are shown to have a polynomial time solution. The general setting in which jobs are not processed in blocks on the critical machine is also discussed. A heuristic is proposed, analyzed and tested.

Original language	English
Journal	Optimization Letters
DOIs	https://doi.org/10.1007/s11590-025-02188-3
State	Accepted/In press - 2025

Bibliographical note

Publisher Copyright:
© The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

Keywords

Dedicated machines
Flowshop
Scheduling
Total completion time
Total load

Access to Document

10.1007/s11590-025-02188-3

Cite this

@article{2d8d4dbd1f6b4dad9266054f091bf215,

title = "A note: on the two-stage flowshop with dedicated machines to minimize total load",

abstract = "We study scheduling problems on a two-stage flowshop, where stage 1 consists of a single (critical) machine and there are a number of parallel dedicated machines in stage 2. The scheduling measure considered is minimum total load. Related measures such as total weighted load, total completion time and total weighted completion time, are also studied. Under a common assumption for this machine setting (of block processing on the critical machine), all these problems are shown to have a polynomial time solution. The general setting in which jobs are not processed in blocks on the critical machine is also discussed. A heuristic is proposed, analyzed and tested.",

keywords = "Dedicated machines, Flowshop, Scheduling, Total completion time, Total load",

author = "Alessandro Agnetis and Gur Mosheiov",

note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.",

year = "2025",

doi = "10.1007/s11590-025-02188-3",

language = "אנגלית",

journal = "Optimization Letters",

issn = "1862-4472",

publisher = "Springer Verlag",

}

TY - JOUR

T1 - A note

T2 - on the two-stage flowshop with dedicated machines to minimize total load

AU - Agnetis, Alessandro

AU - Mosheiov, Gur

N1 - Publisher Copyright: © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

PY - 2025

Y1 - 2025

N2 - We study scheduling problems on a two-stage flowshop, where stage 1 consists of a single (critical) machine and there are a number of parallel dedicated machines in stage 2. The scheduling measure considered is minimum total load. Related measures such as total weighted load, total completion time and total weighted completion time, are also studied. Under a common assumption for this machine setting (of block processing on the critical machine), all these problems are shown to have a polynomial time solution. The general setting in which jobs are not processed in blocks on the critical machine is also discussed. A heuristic is proposed, analyzed and tested.

AB - We study scheduling problems on a two-stage flowshop, where stage 1 consists of a single (critical) machine and there are a number of parallel dedicated machines in stage 2. The scheduling measure considered is minimum total load. Related measures such as total weighted load, total completion time and total weighted completion time, are also studied. Under a common assumption for this machine setting (of block processing on the critical machine), all these problems are shown to have a polynomial time solution. The general setting in which jobs are not processed in blocks on the critical machine is also discussed. A heuristic is proposed, analyzed and tested.

KW - Dedicated machines

KW - Flowshop

KW - Scheduling

KW - Total completion time

KW - Total load

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

U2 - 10.1007/s11590-025-02188-3

DO - 10.1007/s11590-025-02188-3

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

AN - SCOPUS:85218700586

SN - 1862-4472

JO - Optimization Letters

JF - Optimization Letters

ER -

A note: on the two-stage flowshop with dedicated machines to minimize total load

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this