Hits:

Indexed by:期刊论文

Date of Publication:2014-10-01

Journal:JOURNAL OF INTELLIGENT MANUFACTURING

Included Journals:SCIE、EI

Volume:25

Issue:5,SI

Page Number:849-866

ISSN No.:0956-5515

Key Words:Manufacturing scheduling; Multiobjective evolutionary algorithm ( MOEA); Hybrid evolutionary; algorithm (HEA); Job shop scheduling (JSP); Flexible JSP (FJSP); Advanced planning and scheduling (APS); Automatic guided vehicle (AGV)

Abstract:Scheduling is an important tool for a manufacturing system, where it can have a major impact on the productivity of a production process. In order to find an optimal solution to scheduling problems it gives rise to complex combinatorial optimization problems. Unfortunately, most of them fall into the class of NP-hard combinatorial problems. In this paper, we focus on the design of multiobjective evolutionary algorithms (MOEAs) to solve a variety of scheduling problems. Firstly, we introduce fitness assignment mechanism and performance measures for solving multiple objective optimization problems, and introduce evolutionary representations and hybrid evolutionary operations especially for the scheduling problems. Then we apply these EAs to the different types of scheduling problems, included job shop scheduling problem (JSP), flexible JSP, Automatic Guided Vehicle (AGV) dispatching in flexible manufacturing system (FMS), and integrated process planning and scheduling (IPPS). Through a variety of numerical experiments, we demonstrate the effectiveness of these Hybrid EAs (HEAs) in the widely applications of manufacturing scheduling problems. This paper also summarizes a classification of scheduling problems, and illustrates the design way of EAs for the different types of scheduling problems. It is useful to guide how to design an effective EA for the practical manufacturing scheduling problems. As known, these practical scheduling problems are very complex, and almost is a combination of different typical scheduling problems.