A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime

2016 ◽  
Vol 61 ◽  
pp. 290-301 ◽  
Author(s):  
Victor Fernandez-Viagas ◽  
Rainer Leisten ◽  
Jose M. Framinan
Keyword(s):  
Flow Shop ◽  
Total Flowtime ◽  
Computational Evaluation

scholarly journals The distributed permutation flow shop to minimise the total flowtime

2018 ◽  
Vol 118 ◽  
pp. 464-477 ◽  
Author(s):  
Victor Fernandez-Viagas ◽  
Paz Perez-Gonzalez ◽  
Jose M. Framinan
Keyword(s):  
Flow Shop ◽  
Total Flowtime ◽  
Permutation Flow Shop

scholarly journals Minimising Total Flowtime in a No-Wait Flow Shop (NWFS) using Genetic Algorithms

2018 ◽  
Vol 38 (3) ◽  
pp. 68-79 ◽  
Author(s):  
Imran Ali Chaudhry ◽  
Isam AbdulQader Elbadawi ◽  
Muhammad Usman ◽  
Muhammad Tajammal Chughtai
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Flow Shop ◽  
General Purpose ◽  
Flow Shop Scheduling ◽  
Benchmark Problems ◽  
Shop Scheduling ◽  
Total Flowtime ◽  
Spreadsheet Model ◽  
No Wait

This paper considers a no-wait flow shop scheduling (NWFS) problem, where the objective is to minimise the total flowtime. We propose a genetic algorithm (GA) that is implemented in a spreadsheet environment. The GA functions as an add-in in the spreadsheet. It is demonstrated that with proposed approach any criteria can be optimised without modifying the GA routine or spreadsheet model. Furthermore, the proposed method for solving this class of problem is general purpose, as it can be easily customised by adding or removing jobs and machines. Several benchmark problems already published in the literature are used to demonstrate the problem-solving capability of the proposed approach. Benchmark problems set ranges from small (7-jobs, 7 machines) to large (100-jobs, 10-machines). The performance of the GA is compared with different meta-heuristic techniques used in earlier literature. Experimental analysis demonstrate that solutions obtained in this research offer equal quality as compared to algorithms already developed for NWFS problems.

scholarly journals A computational evaluation of constructive heuristics for the parallel blocking flow shop problem with sequence-dependent setup times

2021 ◽  
Vol 12 (3) ◽  
pp. 321-328 ◽  
Author(s):  
Imma Ribas ◽  
Ramon Companys
Keyword(s):  
Completion Time ◽  
Flow Shop ◽  
Parallel Flow ◽  
Setup Times ◽  
Computational Evaluation ◽  
Sequence Dependent ◽  
Sequence Dependent Setup ◽  
Maximum Completion Time ◽  
Dependent Setup Times ◽  
Sequence Dependent Setup Times

This paper deals with the problem of scheduling jobs in a parallel flow shop environment without buffers between machines and with sequence-dependent setup times in order to minimize the maximum completion time of jobs. The blocking constraint normally leads to an increase in the maximum completion time of jobs due to the blockage of machines, which can increase even more so when setup times are considerable. Hence, the heuristic to solve this problem must take into account these specificities in order to minimize the timeout of machines. Because the procedures designed to solve the parallel flow shop scheduling problem must deal not only with the sequencing of jobs but also with their allocation to the flow shops, 36 heuristics have been tested in this paper, of which 35 combine sequencing rules with allocation methods while the last one takes a different approach that is more related to the nature of this problem. The computational evaluation of the implemented heuristics showed good performance of the heuristic designed especially for the problem (RCP0) when the setup times are considerable. Furthermore, the evaluation has also allowed us to propose a combined heuristic that leads to good solutions in a short CPU time.

scholarly journals Algoritmo Híbrido para o Problema Flow Shop de Permutação Multiobjetivo

2020 ◽  
Author(s):  
Volmir Fiorini Júnior ◽  
Carolina Almeida ◽  
Sandra Venske
Keyword(s):  
Flow Shop ◽  
Np Hard ◽  
Nsga Ii ◽  
Total Flowtime

Os algoritmos evolucionários são uma abordagem não determinística para resolver problemas de otimização que não podem ser resolvidos em tempo polinomial, como problemas clássicos NP-Hard. O Flow Shop de Permutação (FSP) é um problema de otimização combinatória do ambiente de produção, em que tarefas devem ser processadas por máquinas, mantendo o mesmo fluxo de processamento. Neste trabalho a abordagem multiobjetivo foi utilizada para o FSP, tendo como objetivos de minimização o makespan e o total flowtime. Dois algoritmos híbridos compostos por NSGA-II com Busca Tabu foram considerados na abordagem e aplicados em 11 instâncias do FSP com diferentes dimensões. Uma análise foi feita sobre o uso de regras de proibição na Busca Tabu e sua restritividade. Os resultados foram analisados utilizando as métricas de qualidade IGD e Função de Conquista Empírica, comparando-os com o NSGA-II canônico.

Sign in / Sign up

Export Citation Format

Share Document