2024
DOI: 10.1016/j.eswa.2023.121856
|View full text |Cite
|
Sign up to set email alerts
|

An effective adaptive iterated greedy algorithm for a cascaded flowshop joint scheduling problem

Chuang Wang,
Quan-Ke Pan,
Xue-Lei Jing
Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 54 publications
0
2
0
Order By: Relevance
“…The greedy algorithm [9], serving as a local search algorithm, plays a crucial role in this study. The fundamental idea of the greedy algorithm is to choose the locally optimal solution at each step, with the expectation of ultimately obtaining a globally optimal solution.…”
Section: Research Methodolpgymentioning
confidence: 99%
“…The greedy algorithm [9], serving as a local search algorithm, plays a crucial role in this study. The fundamental idea of the greedy algorithm is to choose the locally optimal solution at each step, with the expectation of ultimately obtaining a globally optimal solution.…”
Section: Research Methodolpgymentioning
confidence: 99%
“…The flowshop layout is also commonly used in manufacturing systems, where production machines are arranged based on product production routing [7], [8]. A production system with a fellowship configuration exhibits limited flexibility, necessitating serial or multiple flow shop systems [9] or creating a new production line tailored to the new products. A conveyor with a linear flow is the typical material handling equipment employed in production systems with a flow shop layout.…”
Section: Introductionmentioning
confidence: 99%