A Mathematical Model for Multiworkshop IPPS Problem in Batch Production

Abstract

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.

Integrated Optimization Method of IPPS under TOU and Tiered Electricity Price

“…ere are many algorithms to solve multiobjective scheduling problems, such as genetic algorithm [17,18], particle swarm algorithm [19,20], migratory bird optimization algorithm [21,22], and FA [23,24]. As a new swarm intelligence optimization method, FA has the advantages of a simple model, less adjustable parameters, easy parallel processing, and fast convergence speed, so it has been applied in many fields [25,26].…”

“…erefore, in MOFA, there are two ways to update the location of firefly individuals. When the individual x i exists in the current population x j ≺ x i , the location should be updated according to equation (19). When the firefly individual x i does not exist x j ≺ x i in the current solution space, the location should be updated according to formula (20).…”

“…For the continuous solution domain space of the fourth layer based on the startup time coding, the position update operation in the multitarget firefly algorithm is adopted. If the individual is dominated, the location is updated according to equation (19). If the individual is not dominated, move randomly according to formula (20) to increase the diversity of the Pareto solution set.…”

“…If the individual x j is not dominated, it moves randomly according to formula (20). If the individual x j is dominated, the position is updated according to formula (19).…”

A modified integer and categorical PSO algorithm for solving integrated process planning, dynamic scheduling and due date assignment problem

“…PSO has been widely used in literature, especially in IPPS problems. Ba et al [38], have developed a multimodal program using the PSO algorithm for mass production to minimize production time. Petrovic et al [39] focused on using a method based on PSO algorithm and chaos theory to investigate the field of search more extensively in IPPS problems and avoid the local optima.…”