Acceso al sitio web del Consejo de Políticas de Infraestructura

   
ARTÍCULO
TITULO

Evolutionary heuristic for makespan minimization in no-idle flow shop production systems - doi: 10.4025/actascitechnol.v35i2.12534

Marcelo Seido Nagano    
João Carlos Soriano Sampaio Januário    

Resumen

This paper deals with no-idle flow shop scheduling problem with the objective of minimizing makespan. A new hybrid metaheuristic is proposed for the scheduling problem solution. The proposed method is compared with the best method reported in the literature. Experimental results show that the new method provides better solutions regarding the solution quality to set of problems evaluated.  

PÁGINAS
pp. 271 - 278

 Artículos similares

       
 
Stephen A. Adubi, Olufunke O. Oladipupo and Oludayo O. Olugbara    
Hyper-heuristics are widely used for solving numerous complex computational search problems because of their intrinsic capability to generalize across problem domains. The fair-share iterated local search is one of the most successful hyper-heuristics fo... ver más
Revista: Algorithms

 
Michal Berlinski, Eryk Warchulski and Stanislaw Kozdrowski    
This paper presents a logistics problem, related to the transport of goods, which can be applied in practice, for example, in postal or courier services. Two mathematical models are presented as problems occurring in a logistics network. The main objecti... ver más
Revista: Applied Sciences

 
Mingming Xu, Shuning Zhang and Guanlong Deng    
When no-wait constraint holds in job shops, a job has to be processed with no waiting time from the first to the last operation, and the start time of a job is greatly restricted. Using key elements of the iterated greedy algorithm, this paper proposes a... ver más
Revista: Algorithms

 
Hossein R. Najafabadi, Tiago G. Goto, Mizael S. Falheiro, Thiago C. Martins, Ahmad Barari and Marcos S. G. Tsuzuki    
Topology optimization (TO) of engineering products is an important design task to maximize performance and efficiency, which can be divided into two main categories of gradient-based and non-gradient-based methods. In recent years, significant attention ... ver más
Revista: Applied Sciences

 
Uday K. Chakraborty    
The Jaya algorithm is arguably one of the fastest-emerging metaheuristics amongst the newest members of the evolutionary computation family. The present paper proposes a new, improved Jaya algorithm by modifying the update strategies of the best and the ... ver más
Revista: Applied Sciences