Solving the two-stage hybrid flow shop scheduling problem based on mutant firefly algorithm

With the development of industry, the manufacturing system becomes more and more complex. The traditional manufacturing industry is gradually changing to intelligent manufacturing. And it leads to the increase of difficulty of scheduling. This paper presents a mutant firefly algorithm for two-stage...

Full description

Saved in:
Bibliographic Details
Published in:Journal of ambient intelligence and humanized computing 2019-03, Vol.10 (3), p.979-990
Main Authors: Fan, Beibei, Yang, Wenwei, Zhang, Zaifang
Format: Article
Language:English
Subjects:
Algorithms
Artificial Intelligence
Assembly
Coding
Computational Intelligence
Delivery scheduling
Engineering
Genetic algorithms
Heuristic methods
Industrial development
Intelligent manufacturing systems
Investigations
Job shop scheduling
Manufacturing
Mathematical models
Optimization
Original Research
Robotics and Automation
Scheduling
Simulation
User Interfaces and Human Computer Interaction
Workflow
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:With the development of industry, the manufacturing system becomes more and more complex. The traditional manufacturing industry is gradually changing to intelligent manufacturing. And it leads to the increase of difficulty of scheduling. This paper presents a mutant firefly algorithm for two-stage hybrid flow shop scheduling problem with two objective functions. One of it is the simultaneous rate for the arrival of different parts of products at assembly stage and another is the on-time delivery rate based on the products delivery schedule. The function can strengthen the link between the manufacturing stage and the assembly stage. Furthermore, this paper proposes two coding methods, external coding system and internal coding system, to make the coding operation easy to understand and efficient. The simulation results show that the optimized algorithm has better convergence and higher efficiency of calculating. And it has good performance in reducing the number of work in process as well as the pressure on the buffer.
ISSN:1868-5137
1868-5145
DOI:10.1007/s12652-018-0903-3