scholarly journals A Mathematical Model for Multiworkshop IPPS Problem in Batch Production

2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Li Ba ◽  
Yan Li ◽  
Mingshun Yang ◽  
Xueliang Wu ◽  
Yong Liu ◽  
...  

Integrated Process Planning and Scheduling (IPPS) problem is an important issue in production scheduling. Actually, there exit many factors affecting scheduling results. Many types of workpieces are commonly manufactured in batch production. Moreover, due to differences among process methods, all processes of a workpiece may not be performed in the same workshop or even in the same factory. For making IPPS problem more in line with practical manufacturing, this paper addresses an IPPS problem with batches and limited vehicles (BV-IPPS). An equal batch splitting strategy is adopted. A model for BV-IPPS problem is established. Makespan is the objective to be minimized. For solving the complex problem, a particle swarm optimization (PSO) with a multilayer encoding structure is proposed. Each module of the algorithm is designed. Finally, case studies have been conducted to validate the model and algorithm.

2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Shuai Zhang ◽  
Yangbing Xu ◽  
Zhinan Yu ◽  
Wenyu Zhang ◽  
Dejian Yu

Distributed integration of process planning and scheduling (DIPPS) extends traditional integrated process planning and scheduling (IPPS) by considering the distributed features of manufacturing. In this study, we first establish a mathematical model which contains all constraints for the DIPPS problem. Then, the imperialist competitive algorithm (ICA) is extended to effectively solve the DIPPS problem by improving country structure, assimilation strategy, and adding resistance procedure. Next, the genetic algorithm (GA) is adapted to maintain the robustness of the plan and schedule after machine breakdown. Finally, we perform a two-stage experiment to prove the effectiveness and efficiency of extended ICA and GA in solving DIPPS problem with machine breakdown.


2010 ◽  
Vol 118-120 ◽  
pp. 409-413
Author(s):  
Shao Tan Xu ◽  
Xin Yu Li ◽  
Liang Gao ◽  
Yi Sun

To realize the integration of process planning and scheduling (IPPS) in the manufacturing system, a particle swarm optimization (PSO) algorithm is utilized. Based on the general PSO (GPSO) model, one GPSO algorithm is projected to solve IPPS. In GPSO, crossover and mutation operations of genetic algorithm are respectively used for particles to exchange information and search randomly, and tabu search (TS) is used for particles’ local search. And time varying crossover probability and time varying maximum step size of tabu search are introduced. Experimental results show that IPPS can be solved by GPSO effectively. The feasibility of the proposed GPSO model and the significance of the research on IPPS are also demonstrated.


Sign in / Sign up

Export Citation Format

Share Document