Next Article in Journal
Algorithm Based on Heuristic Strategy to Infer Lossy Links in Wireless Sensor Networks
Next Article in Special Issue
Target Channel Visiting Order Design Using Particle Swarm Optimization for Spectrum Handoff in Cognitive Radio Networks
Previous Article in Journal
Pressure Model of Control Valve Based on LS-SVM with the Fruit Fly Algorithm
Previous Article in Special Issue
Solving the Examination Timetabling Problem in GPUs
Article Menu

Export Article

Open AccessArticle
Algorithms 2014, 7(3), 376-396; doi:10.3390/a7030376

A Hybrid Metaheuristic Approach for Minimizing the Total Flow Time in A Flow Shop Sequence Dependent Group Scheduling Problem

1
University of Catania, DII, V.le A. Doria 6, 95125 Catania, Italy
2
University of Catania, DIEEI, V.le A. Doria 6, 95125 Catania, Italy
*
Author to whom correspondence should be addressed.
Received: 15 March 2014 / Revised: 7 May 2014 / Accepted: 4 July 2014 / Published: 14 July 2014
(This article belongs to the Special Issue Bio-inspired Algorithms for Combinatorial Problems)
View Full-Text   |   Download PDF [276 KB, uploaded 14 July 2014]   |  

Abstract

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. View Full-Text
Keywords: cellular manufacturing; genetic algorithm; encoding; decoding; sequencing cellular manufacturing; genetic algorithm; encoding; decoding; sequencing
Figures

This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Costa, A.; Cappadonna, F.A.; Fichera, S. A Hybrid Metaheuristic Approach for Minimizing the Total Flow Time in A Flow Shop Sequence Dependent Group Scheduling Problem. Algorithms 2014, 7, 376-396.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top