A Hybrid Metaheuristic Approach for Minimizing the Total Flow Time in A Flow Shop Sequence Dependent Group Scheduling Problem
Production processes in Cellular Manufacturing Systems (CMS) often involve groups of parts sharing the same technological requirements in terms of tooling and setup. The issue of scheduling such parts through a flow-shop production layout is known as the Flow-Shop Group Scheduling (FSGS) problem or,...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2014-07-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | http://www.mdpi.com/1999-4893/7/3/376 |
id |
doaj-757d0e62c9794f1b925b5d9867693d3b |
---|---|
record_format |
Article |
spelling |
doaj-757d0e62c9794f1b925b5d9867693d3b2020-11-24T21:41:41ZengMDPI AGAlgorithms1999-48932014-07-017337639610.3390/a7030376a7030376A Hybrid Metaheuristic Approach for Minimizing the Total Flow Time in A Flow Shop Sequence Dependent Group Scheduling ProblemAntonio Costa0Fulvio Antonio Cappadonna1Sergio Fichera2University of Catania, DII, V.le A. Doria 6, 95125 Catania, ItalyUniversity of Catania, DIEEI, V.le A. Doria 6, 95125 Catania, ItalyUniversity of Catania, DII, V.le A. Doria 6, 95125 Catania, ItalyProduction processes in Cellular Manufacturing Systems (CMS) often involve groups of parts sharing the same technological requirements in terms of tooling and setup. The issue of scheduling such parts through a flow-shop production layout is known as the Flow-Shop Group Scheduling (FSGS) problem or, whether setup times are sequence-dependent, the Flow-Shop Sequence-Dependent Group Scheduling (FSDGS) problem. This paper addresses the FSDGS issue, proposing a hybrid metaheuristic procedure integrating features from Genetic Algorithms (GAs) and Biased Random Sampling (BRS) search techniques with the aim of minimizing the total flow time, i.e., the sum of completion times of all jobs. A well-known benchmark of test cases, entailing problems with two, three, and six machines, is employed for both tuning the relevant parameters of the developed procedure and assessing its performances against two metaheuristic algorithms recently presented by literature. The obtained results and a properly arranged ANOVA analysis highlight the superiority of the proposed approach in tackling the scheduling problem under investigation.http://www.mdpi.com/1999-4893/7/3/376cellular manufacturinggenetic algorithmencodingdecodingsequencing |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Antonio Costa Fulvio Antonio Cappadonna Sergio Fichera |
spellingShingle |
Antonio Costa Fulvio Antonio Cappadonna Sergio Fichera A Hybrid Metaheuristic Approach for Minimizing the Total Flow Time in A Flow Shop Sequence Dependent Group Scheduling Problem Algorithms cellular manufacturing genetic algorithm encoding decoding sequencing |
author_facet |
Antonio Costa Fulvio Antonio Cappadonna Sergio Fichera |
author_sort |
Antonio Costa |
title |
A Hybrid Metaheuristic Approach for Minimizing the Total Flow Time in A Flow Shop Sequence Dependent Group Scheduling Problem |
title_short |
A Hybrid Metaheuristic Approach for Minimizing the Total Flow Time in A Flow Shop Sequence Dependent Group Scheduling Problem |
title_full |
A Hybrid Metaheuristic Approach for Minimizing the Total Flow Time in A Flow Shop Sequence Dependent Group Scheduling Problem |
title_fullStr |
A Hybrid Metaheuristic Approach for Minimizing the Total Flow Time in A Flow Shop Sequence Dependent Group Scheduling Problem |
title_full_unstemmed |
A Hybrid Metaheuristic Approach for Minimizing the Total Flow Time in A Flow Shop Sequence Dependent Group Scheduling Problem |
title_sort |
hybrid metaheuristic approach for minimizing the total flow time in a flow shop sequence dependent group scheduling problem |
publisher |
MDPI AG |
series |
Algorithms |
issn |
1999-4893 |
publishDate |
2014-07-01 |
description |
Production processes in Cellular Manufacturing Systems (CMS) often involve groups of parts sharing the same technological requirements in terms of tooling and setup. The issue of scheduling such parts through a flow-shop production layout is known as the Flow-Shop Group Scheduling (FSGS) problem or, whether setup times are sequence-dependent, the Flow-Shop Sequence-Dependent Group Scheduling (FSDGS) problem. This paper addresses the FSDGS issue, proposing a hybrid metaheuristic procedure integrating features from Genetic Algorithms (GAs) and Biased Random Sampling (BRS) search techniques with the aim of minimizing the total flow time, i.e., the sum of completion times of all jobs. A well-known benchmark of test cases, entailing problems with two, three, and six machines, is employed for both tuning the relevant parameters of the developed procedure and assessing its performances against two metaheuristic algorithms recently presented by literature. The obtained results and a properly arranged ANOVA analysis highlight the superiority of the proposed approach in tackling the scheduling problem under investigation. |
topic |
cellular manufacturing genetic algorithm encoding decoding sequencing |
url |
http://www.mdpi.com/1999-4893/7/3/376 |
work_keys_str_mv |
AT antoniocosta ahybridmetaheuristicapproachforminimizingthetotalflowtimeinaflowshopsequencedependentgroupschedulingproblem AT fulvioantoniocappadonna ahybridmetaheuristicapproachforminimizingthetotalflowtimeinaflowshopsequencedependentgroupschedulingproblem AT sergiofichera ahybridmetaheuristicapproachforminimizingthetotalflowtimeinaflowshopsequencedependentgroupschedulingproblem AT antoniocosta hybridmetaheuristicapproachforminimizingthetotalflowtimeinaflowshopsequencedependentgroupschedulingproblem AT fulvioantoniocappadonna hybridmetaheuristicapproachforminimizingthetotalflowtimeinaflowshopsequencedependentgroupschedulingproblem AT sergiofichera hybridmetaheuristicapproachforminimizingthetotalflowtimeinaflowshopsequencedependentgroupschedulingproblem |
_version_ |
1725920437329723392 |