Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times

Authors:
Shih-Wei Lin;Kuo-Ching Ying;Zne-Jung Lee
Affiliations:
Department of Information Management, Chang Gung University, Tao-Yuan, Taiwan, ROC and Department of Information Management, Huafan University, No. 1, Huafan Road, Taipei, Taiwan, ROC;Department of Industrial Engineering and Management Information, Huafan University, No. 1, Huafan Road, Taipei, Taiwan, ROC;Department of Information Management, Huafan University, No. 1, Huafan Road, Taipei, Taiwan, ROC
Venue:
Computers and Operations Research
Year:
2009

Citing 13
Cited 9

Single facility multi-class job scheduling

Computers and Operations Research
Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Heuristics for operator scheduling in group technology cells

Computers and Operations Research
Group scheduling on two cells with intercell movement

Computers and Operations Research
Two-machine flowshop group scheduling problem

Computers and Operations Research
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Tabu Search

Tabu Search
Uniform Crossover in Genetic Algorithms

Proceedings of the 3rd International Conference on Genetic Algorithms
A very fast Tabu search algorithm for the permutation flow shop problem with makespan criterion

Computers and Operations Research
Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups

Computers and Industrial Engineering - Special issue: Group technology/cellular manufacturing
Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups

Computers and Operations Research
Forming part families by using genetic algorithm and designing machine cells under demand changes

Computers and Operations Research
Solving Part-Type Selection and Operation Allocation Problems in an FMS: An Approach Using Constraints-Based Fast Simulated Annealing Algorithm

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Design of a scatter search method for a novel multi-criteria group scheduling problem in a cellular manufacturing system

Expert Systems with Applications: An International Journal
A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times

Computers and Operations Research
A simulated annealing algorithm for the job shop cell scheduling problem with intercellular moves and reentrant parts

Computers and Industrial Engineering
Minimizing makespan in a flow-line manufacturing cell with sequence dependent family setup times

Expert Systems with Applications: An International Journal
A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties

Expert Systems with Applications: An International Journal
Scheduling Cellular Manufacturing Systems Using ACO and GA

International Journal of Applied Metaheuristic Computing
A comparison of two chromosome representation schemes used in solving a family-based scheduling problem

Robotics and Computer-Integrated Manufacturing
Dynamic parts scheduling in multiple job shop cells considering intercell moves and flexible routes

Computers and Operations Research
Effect of solution representations on Tabu search in scheduling applications

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

The broad applications of cellular manufacturing make flowline manufacturing cell scheduling problems with sequence dependent family setup times a core topic in the field of scheduling. Due to computational complexity, almost all published studies focus on using permutation schedules to deal with this problem. To explore the potential effectiveness of treating this argument using non-permutation schedules, three prominent types of metaheuristics-a simulated annealing, a genetic algorithm and a tabu search-are proposed and empirically evaluated. The experimental results demonstrate that in general, the improvement made by non-permutation schedules over permutation schedules for the due-date-based performance criteria were significantly better than that for the completion-time-based criteria. The results of this study will provide practitioners a guideline as to when to adopt a non-permutation schedule, which may exhibit better performance with additional computational efforts.