2016
DOI: 10.1016/j.ins.2015.09.042
|View full text |Cite
|
Sign up to set email alerts
|

Benchmarks for fuzzy job shop problems

Abstract: Highlights• The fuzzy job shop scheduling problem with makespan minimization is revised• We survey existing metaheuristic methods and test beds for the problem • More challenging benchmark instances with LBs and competitive results are proposed• We publish old and new test beds to facilitate reproducibility and future research 1 AbstractThe fuzzy job shop scheduling problem with makespan minimisation is a problem with a significant presence in the scientific literature. However, a common meaningful comparison … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
4
3
1

Relationship

2
6

Authors

Journals

citations
Cited by 21 publications
(23 citation statements)
references
References 55 publications
0
17
0
Order By: Relevance
“…For all algorithms in this chapter, the size of the population Ns = 100, and the maximum number of iterations is set to max_ite = 1000. According to the literatures [28,38] and experiments, the parameter for the IHKA is set as N ξ = 10, α = 0.9, β = 5 and Bsi ze = Nd 5 + 0.5 . The parameter for the PSO is set as c 1 = 2.8, c 2 = 1.3 and w = 0.729 [33].…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…For all algorithms in this chapter, the size of the population Ns = 100, and the maximum number of iterations is set to max_ite = 1000. According to the literatures [28,38] and experiments, the parameter for the IHKA is set as N ξ = 10, α = 0.9, β = 5 and Bsi ze = Nd 5 + 0.5 . The parameter for the PSO is set as c 1 = 2.8, c 2 = 1.3 and w = 0.729 [33].…”
Section: Resultsmentioning
confidence: 99%
“…Particularly deeply explored is the field of Planning and Scheduling, from service activities [42] to production systems [37]. The authors implement Artificial Intelligence algorithms to benchmark examples [28], as well as to realworld examples [33]. The high efficiency of modern Artificial Intelligence methods are reflected in the implementation of the Kalman Filter approach for the purpose of multiprocessor evolutionary computation and obtaining estimated solutions [21].…”
Section: Literature Reviewmentioning
confidence: 99%
“…The authors present their research work in two separate groups. Some researchers perform experiments on benchmark datasets (Palacios et al, 2016), while others perform their optimization algorithms in applied cases. In doing so, there is a problem of mutual evaluation and comparison, since, in some cases, it is impossible to transfer parallels.…”
Section: Issues and Open Questionsmentioning
confidence: 99%
“…Palacios et al 24 proposed benchmarks for fuzzy job shop problems, and had played out to fill the gap around by investigating existing benchmarks and moreover proposing new benchmark issues. In the light of this examination, they had proposed another gathering of all troublesome benchmark issues and gave cut down points of confinement to the typical makes of the dish of each event, and likewise, reference makespan values procured with a mimetic computation from the composition.…”
Section: Literature Reviewmentioning
confidence: 99%