本书总结了作者在集成式工艺规划与车间调度问题上的研究成果，共包含5个部分共二十一章。第一部分重点对工艺规划、车间调度、柔性作业车间调度以及集成式工艺规划与车间调度等问题的最新研究成果进行了系统的综述；第二部分重点针对单目标的集成式工艺规划与车间调度问题的理论与方法进行系统介绍，提出了该问题的数学模型以及高效优化方法；第三部分重点针对多目标的集成式工艺规划与车间调度问题的理论与方法进行系统介绍，提出了该问题的多目标数学模型以及高效优化及决策方法；第四部分重点针对不确定及动态环境下的集成式工艺规划与车间调度问题的理论与方法进行系统介绍，提出了该问题的数学模型、处理策略以及高效优化方法；第五部分重点针对集成式工艺规划与车间调度问题研究成果的应用进行系统介绍，设计并开发了针对该问题的软件系统，并介绍了该系统的在相关生产车间的应用情况。

1 Introduction for Integrated Process Planning and Scheduling
1.1 Process Planning
1.2 Shop Scheduling
1.2.1 Problem Statement
1.2.2 Problem Properties
1.2.3 Literature Review
1.3 Integrated Process Planning and Shop Scheduling
References
2.Review for Flexible Job Shop Scheduling
2.1 Introduction
2.2 Problem Description
2.3 The Methods for FISP
2.3.1 Exact Algorithms
2.3.2 Heuristics
2.3.3 Meta-Heuristics
2.4 Real-World Applications
2.5 Development Trends and Future Research Opportunities
2.5.1 Development Trends
2.5.2 Future Research Opportunities
References
3 Review for Integrated Process Planning and Scheduling
3.1 IPPS in Support of Distributed and Collaborative Manufacturing
3.2 Integration Model of IPPS
3.2.1 Non-I ,inear Process Planning
3.2.2 Closed-Loop Process Planning
3.2.3 Distributed Process Planning
3.2.4 Comparison of Integration Models
3.3 Implementation Approaches of IPPS
3.3.1 Agent- Based Approaches of IPPS
3.3.2 Petri-Net-Based Approaches of IPPS
3.3.3 Algorithm-Based Approaches of IPPS
3.3.4 Critique of Curent Implementation Approachs
References
4 Improved Genetic Programming for Process Planning
4.1 Introduction
4.2 Flexible Process Planning
4.2.1 Flexible Process Plans
4.2.2 Representation of Flexible Process Plans
4.2.3 Mathematical Model of Flexible Process Planning
4.3 Brief Review of GP
4.4 GP for Flexible Process Planning
4.4.1 The Flowchart of Proposed Metbod
4.4.2 Convert Network to Tree, Encoding, and Decoding
4.4.3 Initial Population and Fitness Evaluation
4.4.4 GP Operators
4.5 Case Studies and Discussion
4.5.1 Implementation and Testing
4.5.2 Comparison with GA
4.6 Conclusion
References
5 An Efficient Modified Particle Swarm Optimization Algorithm for Process Planning
5.1 Introduction
5.2 Related Work
5.2.1 Process Planning
5.2.2 PSO with Its Applications
5.3 Problem Formulation
5.3.1 Flexible Process Plans
5.3.2 Mathematical Model of Process Planning Problem
5.4 Modified PSO for Process Planning
5.4.1 Modified PSO Model
5.4.2 Modified PSO for Process Planning
5.5 Experimental Studies and Discussions
5.5.1 Case Studies and Results
5.5.2 Discussion
5.6 Conclusions and Future Research Studics
References
6 A Hybrid Algorithm for Job Shop Scheduling Problem
6.1 Introduction
6.2 Problem Formulation
6.3 Proposed Hybrid Algorithm for JSP
6.3.1 Description of the Proposed Hybrid Algorithm
6.3.2 Encoding and Decoding Scheme
6.3.3 Updating Srace
6.3.4 Local Search of the Particle
6.4 The Neighborthood Structure Evaluation Method Based on Logistic Model
6.4.1 The Logistic Model
6.4.2 Defining Neighbothood Structures
6.4.3 The Evaluation Method Based on Logistic Model
6.5 Experiments and Discussion
6.5.1 The Search Ability of VNS
6.5.2 Benchmark Experiments
6.5.3 Convergence Analysis of HPV
6.5.4 Discussion
6.6 Conclusions and Future Works
References
7 An Efctive Genetic Algorithm for FJSP
7.1 Introduction
7.2 Problem Formulation
7.3 L ,iterature Review
7.4 An Effective GA for FISP
7.4.1 Representation
7.4.2 Decoding the MSOS Chromosome to a Feasibleand Active Schedule
7.4.3 Initial Population
7.4.4 Selection Operator
7.4.5 Crossover Operator
7.4.6 Mutation Operator
7.4.7 Framework of the Effective GA
7.5 Computational Results
7.6 Conclusions and Future Study
References
8 An Elfective Collaborative Evolutionary Algorithm for FJSP
8.1 Initroduction
8.2 Problem Formulation
Proposed MSCEA for FISP
8.3.1 The Optimization Strategy of MSCEA
8.3.2 Encoding
8.3.3 Initial Population and Fitness Evaluation
8.3.4 Genetic Operators