2011
DOI: 10.1080/00207543.2010.528056
|View full text |Cite
|
Sign up to set email alerts
|

A modified harmony search algorithm for the multi-objective flowshop scheduling problem with due dates

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 17 publications
(1 citation statement)
references
References 42 publications
0
1
0
Order By: Relevance
“…To do so, a new memory will be defined; namely, the Pareto Set (or non-dominated memory) in which all the non-dominated solutions during all iterations will be saved in it [10].…”
Section: The Proposed Mo-hs Schemementioning
confidence: 99%
“…To do so, a new memory will be defined; namely, the Pareto Set (or non-dominated memory) in which all the non-dominated solutions during all iterations will be saved in it [10].…”
Section: The Proposed Mo-hs Schemementioning
confidence: 99%