2015
DOI: 10.1007/978-3-662-47926-1_41
|View full text |Cite
|
Sign up to set email alerts
|

A Pareto-Based Discrete Harmony Search Algorithm for Bi-objective Reentrant Hybrid Flowshop Scheduling Problem

Abstract: In this paper, a Pareto-based discrete harmony search (P-DHS) algorithm is proposed to solve the reentrant hybrid flowshop scheduling problem (RHFSP) with the makespan and the total tardiness criteria. For each job, the operation set of each pass is regarded as a sub-job. To adopt the harmony search algorithm to solve the RHFSP, each harmony vector is represented by a discrete sub-job sequence, which determines the priority to allocate all the operations. To handle the discrete representation, a novel improvis… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 26 publications
0
3
0
Order By: Relevance
“…The RHFSP addressed in this study can be described as follows [17,26,27]: n jobs need to be processed in s stages in sequence. There are identical parallel machines in the stage i, and each job can be processed on any machine in the corresponding stage.…”
Section: Problem Descriptionmentioning
confidence: 99%
See 1 more Smart Citation
“…The RHFSP addressed in this study can be described as follows [17,26,27]: n jobs need to be processed in s stages in sequence. There are identical parallel machines in the stage i, and each job can be processed on any machine in the corresponding stage.…”
Section: Problem Descriptionmentioning
confidence: 99%
“…Ying and Lin et al [15] proposed an efficient iterative Pareto greedy (IPG) algorithm based on the research in [13]. Shen and Wang et al [16,17] proposed an improved teaching and learning optimization algorithm and a Pareto discrete harmony search algorithm to solve the biobjective RHFSP.…”
Section: Introductionmentioning
confidence: 99%
“…Ying et al [10] used an iterative Pareto greedy algorithm for the bi-objective RHFSP based on the research in [9]. Shen et al [11,12] applied an improved teaching and learning optimization algorithm and a Pareto-based discrete harmony search algorithm to solve the bi-objective RHFSP. Cheng and Lei [13] studied an improved imperialist competition algorithm for the RSP in order to minimise the makespan and total tardiness.…”
Section: Introductionmentioning
confidence: 99%