2017
DOI: 10.4172/2169-0316.1000225
|View full text |Cite
|
Sign up to set email alerts
|

An Effective Harmony Search Algorithm for Solving a No-Wait Hybrid Flow Shop Scheduling Problem with Machine Availability Constraint

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…The study also recommended enhancing meta-heuristic algorithms by incorporating local search strategies for solution improvement. Rahmanidoust et al (2017) conducted a study to investigate the performances of Harmony Search (HS), Imperialist Competitive Algorithm (ICA), and hybridization of PBSA and ICA (ICA+PBSA) when applied to solve the problem of no-wait hybrid flow shop scheduling in relation to UPMSPs. The objective of the study was to minimize the mean tardiness while addressing four specific challenges: no-wait operations, separate setup time of each job from its processing time, coordination with job arrival time, and inconsistent machine availability.…”
Section: Hybrid Based Optimization Algorithms For Upmspmentioning
confidence: 99%
See 1 more Smart Citation
“…The study also recommended enhancing meta-heuristic algorithms by incorporating local search strategies for solution improvement. Rahmanidoust et al (2017) conducted a study to investigate the performances of Harmony Search (HS), Imperialist Competitive Algorithm (ICA), and hybridization of PBSA and ICA (ICA+PBSA) when applied to solve the problem of no-wait hybrid flow shop scheduling in relation to UPMSPs. The objective of the study was to minimize the mean tardiness while addressing four specific challenges: no-wait operations, separate setup time of each job from its processing time, coordination with job arrival time, and inconsistent machine availability.…”
Section: Hybrid Based Optimization Algorithms For Upmspmentioning
confidence: 99%
“…Additionally, the authors proposed exploring models characterized by emergency maintenance, learning effect, and deterioration, as they may yield interesting performance outcomes. Furthermore, Rahmanidoust et al (2017) explored various metaheuristic algorithms, including HS, ICA, and ICA+PBSA, to solve the problem of no-wait hybrid flow shop scheduling in UPMSPs. The study highlighted the superior performance of HS and recommended further research into alternative meta-heuristic approaches and the incorporation of additional problem characteristics.…”
Section: Hybrid Based Optimization Algorithms For Upmspmentioning
confidence: 99%