2007
DOI: 10.1016/j.ejor.2006.06.010
|View full text |Cite
|
Sign up to set email alerts
|

On operators and search space topology in multi-objective flow shop scheduling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
23
0

Year Published

2009
2009
2017
2017

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 41 publications
(23 citation statements)
references
References 17 publications
0
23
0
Order By: Relevance
“…The reader is referred to T' Kindt and Billaut (2002), Landa et al (2004) for a survey on multiobjective scheduling. Note that both stand-alone and hybrid DMLS-like algorithms have already been applied with success to biobjective flowshop scheduling problems (Basseur et al 2002;Geiger 2007;Dubois-Lacoste et al 2009). Here, some results are also reported for the threeobjective case.…”
Section: Application 1: Permutation Flowshop Scheduling Problemmentioning
confidence: 98%
See 1 more Smart Citation
“…The reader is referred to T' Kindt and Billaut (2002), Landa et al (2004) for a survey on multiobjective scheduling. Note that both stand-alone and hybrid DMLS-like algorithms have already been applied with success to biobjective flowshop scheduling problems (Basseur et al 2002;Geiger 2007;Dubois-Lacoste et al 2009). Here, some results are also reported for the threeobjective case.…”
Section: Application 1: Permutation Flowshop Scheduling Problemmentioning
confidence: 98%
“…This process is repeated for all archive members until no more progress can be made. This class of algorithms has shown its efficiency for various MCOPs, either as stand-alone approaches (Paquete et al 2004;Paquete and Stützle 2006;Geiger 2007) or hybridized with other techniques like hybrid metaheuristics (Talbi et al 2001;Basseur et al 2002) and two-phase heuristics Stützle 2006, 2009;Dubois-Lacoste et al 2009;Lust and Teghem 2010;Lust and Jaszkiewicz 2010).…”
Section: Multiobjective Local Searchmentioning
confidence: 99%
“…MOPS yields better results than SPEAII according to the reported computational experimentation albeit at a higher CPU time requirements. Finally, Geiger 62 has published an interesting study where the topology of the multiobjective flow-shop problem search space is examined. Using several local search algorithms, the author analyzes the distribution of several objectives and tests several combinations of criteria.…”
Section: Pareto Approachesmentioning
confidence: 99%
“…In the 100-factor solution, 21 factors are related to MCDM applications. These applications cover not only traditional application areas, such as asset management [24], scheduling problem [25], assignment problem [26], questionnaire survey [27], credit scoring [28,29,30,31], and risk evaluation [32,33,34]; but also emerging novel areas, such as verbal data classification [35], Web-based decision support [36], habitual domains [37], electronic commerce systems [38,39], and e-participation [40]. The second trend is that MCDM has entered into some new research areas [41].…”
Section: Different Factor Solutionsmentioning
confidence: 99%