Dynamic parts scheduling in multiple job shop cells considering intercell moves and flexible routes

Authors:
Dongni Li;Yan Wang;Guangxue Xiao;Jiafu Tang
Affiliations:
Beijing Lab of Intelligent Information Technology, School of Computer Science, Beijing Institute of Technology, Beijing 100081, China;Beijing Lab of Intelligent Information Technology, School of Computer Science, Beijing Institute of Technology, Beijing 100081, China;Beijing Lab of Intelligent Information Technology, School of Computer Science, Beijing Institute of Technology, Beijing 100081, China;National Key Laboratory of Process Industry Automation, Northeastern University, Shenyang, Liaoning 110004, China
Venue:
Computers and Operations Research
Year:
2013

Citing 16
Cited 0

A genetic algorithm for family and job scheduling in a flowline-based manufacturing cell

ICC&IE-94 Selected papers from the 16th annual conference on Computers and industrial engineering
Group scheduling on two cells with intercell movement

Computers and Operations Research
Evaluation of alternate routing policies in scheduling a job-shop type FMS

Computers and Industrial Engineering
Holonic manufacturing scheduling: architecture, cooperation mechanism and implementation

Computers in Industry - Special issue on manufacturing systems
Wasp-like Agents for Distributed Factory Coordination

Autonomous Agents and Multi-Agent Systems
Genetic algorithms in agent-based manufacturing scheduling systems

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

Computers and Operations Research
An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem

Computers and Industrial Engineering
An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems

Computers and Industrial Engineering
A genetic algorithm based heuristic for scheduling of virtual manufacturing cells (VMCs)

Computers and Operations Research
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
Bi-objective group scheduling in hybrid flexible flowshop: A multi-phase approach

Expert Systems with Applications: An International Journal
Job shop scheduling by pheromone approach in a dynamic environment

International Journal of Computer Integrated Manufacturing
A simulated annealing algorithm for the job shop cell scheduling problem with intercellular moves and reentrant parts

Computers and Industrial Engineering
An adaptive multi-population genetic algorithm to solve the multi-objective group scheduling problem in hybrid flexible flowshop with sequence-dependent setup times

Journal of Intelligent Manufacturing
Scheduling groups of jobs in the two-machine flow shop

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

Aiming at the problem of scheduling with flexible processing routes and exceptional parts that need to visit machines located in multiple job shop cells, a pheromone based approach (PBA) using multi-agent is presented in this paper, in which various types of pheromone inspired by ant colony optimization (ACO) are adopted as the basis of negotiation among agents. By removing redundant routes and constructing coalition agents, communication cost and negotiation complexity are reduced, and more importantly, the global performance of scheduling is improved. The performance of the PBA is evaluated via experiments with respect to the mean flow time, maximum completion time, mean tardiness, ratio of tardy parts, and ratio of intercell moves. Computational results show that compared with various heuristics, the PBA has significant advantages with respect to the performance measures considered in this paper.