2018 XLIV Latin American Computer Conference (CLEI) 2018
DOI: 10.1109/clei.2018.00027
|View full text |Cite
|
Sign up to set email alerts
|

A Clustering Search Metaheuristic for the Bi-objective Flexible Job Shop Scheduling Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 28 publications
0
1
0
Order By: Relevance
“…This paper is closely related to the work about the FJSP of Altoé et al. (2018). In contrast to our work, these authors considered another set of objective functions (i.e., minimizing makespan and total tardiness), for which the Pareto frontier is sought (i.e., no lexicographic approach is used).…”
Section: Introductionmentioning
confidence: 69%
“…This paper is closely related to the work about the FJSP of Altoé et al. (2018). In contrast to our work, these authors considered another set of objective functions (i.e., minimizing makespan and total tardiness), for which the Pareto frontier is sought (i.e., no lexicographic approach is used).…”
Section: Introductionmentioning
confidence: 69%