Parameter Settings and Representations in Pareto-Based Optimization for Job Shop Scheduling

Esquivel, Susana Cecilia; Ferrero, Sergio W.; Gallard, Raúl Hector

doi:10.1080/01969720290040759

Cited by 8 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hooker (1995) argues that researchers should focus on scienti c testing rather than competitive testing. Esquivel et al (2002) proposed that evolutionary computation techniques are very able to build well-delineated Pareto fronts in multiobjective optimization problems and applied it to the job shop scheduling problem. ey stressed that good parameter se ings can enhance the behavior of the evolutionary algorithm.…”

Section: Literaturementioning

confidence: 99%

Studying the influence of algorithmic parameters and instance characteristics on the performance of a multiobjective algorithm using the Promethee method

Janssens

Sörensen

Janssens

2019

Cybernetics and Systems

View full text Add to dashboard Cite

A method is proposed to analyse the e ect of the algorithmic parameters and instance characteristics on the quality of a Pareto front produced by a multi-objective algorithm. is method is applied to a variable neighborhood tabu search that is used to solve a multi-objective microzone-based vehicle routing problem. Our method can accommodate many di erent performance indices for Pareto fronts and uses the P multicriteria decision analysis method to select the best con guration based on the characteristics of the instance being solved.

show abstract

Section: Literaturementioning

confidence: 99%

Studying the influence of algorithmic parameters and instance characteristics on the performance of a multiobjective algorithm using the Promethee method

Janssens

Sörensen

Janssens

2019

Cybernetics and Systems

View full text Add to dashboard Cite

show abstract

“…Permutation with repetition was introduced by Bierwierth [11] and the chromosome gene encoded an operation to index the actions which they belong to and index the actions how many times have operations in these actions. Permutation without of repetition was created by Esquivel et al [12], but this algorithm has a very small domain of applicability. In this case is generated a priority list of actions to allocate the operation on the resource or processor which is in conflict situation, i.e.…”

Section: Local Searchmentioning

confidence: 99%

Methods & Algorithms in Manufacturing and Assembly Industry Scheduling for Flexible Manufacturing System

Gorgoi

2013

AMR

View full text Add to dashboard Cite

Flexible Manufacturing Systems-FMS is a term with various types of definitions, each of them trying to describe the complexity and the generalized features. One of these features is their complexity, along with difficulties in building models that capture the system in all its important aspects. In a heterogeneous flexible system, the scheduling events or actions could be a combinatorial problem which claims a particular solution. Manufacturing scheduling process, in special for FMS, is a very difficult scheduling problem, because involves all the aspects of the processes: order, resources, transportation system i.e. automated vehicle guided, perturbation factors such as breakdowns of machine, etc. Typically, the scheduling problem is a NP-hard problem modeled in mathematical form. If we simulate n jobs or orders which have to be assigned to the m machines or resources, we will observe that the mathematical solution is a huge number that means (n!)m possibilities of solutions. The challenge of researchers is to solve this equation in a reasonable time with an optimal solution, and of course with minimal resources. Those scientists applied many solutions which became Operational Research-OR or Combinatorial Optimization-CO areas using a various methods: Local Search-LS, Artificial Intelligence-AI, heuristic method, priority rules, memetic or hybrid techniques which combine this techniques.

show abstract

Determining optimal combination of genetic operators for flow shop scheduling

Wang

Zhang

2005

Int J Adv Manuf Technol

View full text Add to dashboard Cite

Parameter Settings and Representations in Pareto-Based Optimization for Job Shop Scheduling

Cited by 8 publications

References 12 publications

Studying the influence of algorithmic parameters and instance characteristics on the performance of a multiobjective algorithm using the Promethee method

Studying the influence of algorithmic parameters and instance characteristics on the performance of a multiobjective algorithm using the Promethee method

Methods & Algorithms in Manufacturing and Assembly Industry Scheduling for Flexible Manufacturing System

Determining optimal combination of genetic operators for flow shop scheduling

Contact Info

Product

Resources

About