Optimisation of integrated process planning and scheduling using a particle swarm optimisation approach

Research output: Contribution to journalArticle

58 Citations (Scopus)

Abstract

Traditionally, process planning and scheduling are two independent essential functions in a job shop manufacturing environment. In this paper, a unified representation model for integrated process planning and scheduling (IPPS) has been developed. Based on this model, a modern evolutionary algorithm, i.e. the particle swarm optimisation (PSO) algorithm has been employed to optimise the IPPS problem. To explore the search space comprehensively, and to avoid being trapped into local optima, the PSO algorithm has been enhanced with new operators to improve its performance and different criteria, such as makespan, total job tardiness and balanced level of machine utilisation, have been used to evaluate the job performance. To improve the flexibility and agility, a re-planning method has been developed to address the conditions of machine breakdown and new order arrival. Case studies have been used to a verify the performance and efficiency of the modified PSO algorithm under different criteria. A comparison has been made between the result of the modified PSO algorithm and those of the genetic algorithm (GA) and the simulated annealing (SA) algorithm respectively, and different characteristics of the three algorithms are indicated. Case studies show that the developed PSO can generate satisfactory results in optimising the IPPS problem.
Original languageEnglish
Pages (from-to)3775-3796
Number of pages22
JournalInternational Journal of Production Research
Volume47
Issue number14
Early online date12 May 2009
DOIs
Publication statusPublished - 15 Jul 2009

Fingerprint

Process planning
Particle swarm optimization (PSO)
Scheduling
Simulated annealing
Evolutionary algorithms
Particle swarm optimization
Planning and scheduling
Integrated process
Mathematical operators
Genetic algorithms
Planning

Keywords

  • simulated annealing
  • genetic algorithm
  • particle swarm
  • re-planning
  • optimisation
  • integrated process planning and scheduling

Cite this

@article{c972ee08b6254ff1b44cb49664b71d21,
title = "Optimisation of integrated process planning and scheduling using a particle swarm optimisation approach",
abstract = "Traditionally, process planning and scheduling are two independent essential functions in a job shop manufacturing environment. In this paper, a unified representation model for integrated process planning and scheduling (IPPS) has been developed. Based on this model, a modern evolutionary algorithm, i.e. the particle swarm optimisation (PSO) algorithm has been employed to optimise the IPPS problem. To explore the search space comprehensively, and to avoid being trapped into local optima, the PSO algorithm has been enhanced with new operators to improve its performance and different criteria, such as makespan, total job tardiness and balanced level of machine utilisation, have been used to evaluate the job performance. To improve the flexibility and agility, a re-planning method has been developed to address the conditions of machine breakdown and new order arrival. Case studies have been used to a verify the performance and efficiency of the modified PSO algorithm under different criteria. A comparison has been made between the result of the modified PSO algorithm and those of the genetic algorithm (GA) and the simulated annealing (SA) algorithm respectively, and different characteristics of the three algorithms are indicated. Case studies show that the developed PSO can generate satisfactory results in optimising the IPPS problem.",
keywords = "simulated annealing, genetic algorithm, particle swarm, re-planning, optimisation, integrated process planning and scheduling",
author = "Guo, {Y W} and Li, {W D} and Mileham, {Antony R} and Owen, {Geraint W}",
year = "2009",
month = "7",
day = "15",
doi = "10.1080/00207540701827905",
language = "English",
volume = "47",
pages = "3775--3796",
journal = "International Journal of Production Research",
issn = "0020-7543",
publisher = "Taylor and Francis",
number = "14",

}

TY - JOUR

T1 - Optimisation of integrated process planning and scheduling using a particle swarm optimisation approach

AU - Guo, Y W

AU - Li, W D

AU - Mileham, Antony R

AU - Owen, Geraint W

PY - 2009/7/15

Y1 - 2009/7/15

N2 - Traditionally, process planning and scheduling are two independent essential functions in a job shop manufacturing environment. In this paper, a unified representation model for integrated process planning and scheduling (IPPS) has been developed. Based on this model, a modern evolutionary algorithm, i.e. the particle swarm optimisation (PSO) algorithm has been employed to optimise the IPPS problem. To explore the search space comprehensively, and to avoid being trapped into local optima, the PSO algorithm has been enhanced with new operators to improve its performance and different criteria, such as makespan, total job tardiness and balanced level of machine utilisation, have been used to evaluate the job performance. To improve the flexibility and agility, a re-planning method has been developed to address the conditions of machine breakdown and new order arrival. Case studies have been used to a verify the performance and efficiency of the modified PSO algorithm under different criteria. A comparison has been made between the result of the modified PSO algorithm and those of the genetic algorithm (GA) and the simulated annealing (SA) algorithm respectively, and different characteristics of the three algorithms are indicated. Case studies show that the developed PSO can generate satisfactory results in optimising the IPPS problem.

AB - Traditionally, process planning and scheduling are two independent essential functions in a job shop manufacturing environment. In this paper, a unified representation model for integrated process planning and scheduling (IPPS) has been developed. Based on this model, a modern evolutionary algorithm, i.e. the particle swarm optimisation (PSO) algorithm has been employed to optimise the IPPS problem. To explore the search space comprehensively, and to avoid being trapped into local optima, the PSO algorithm has been enhanced with new operators to improve its performance and different criteria, such as makespan, total job tardiness and balanced level of machine utilisation, have been used to evaluate the job performance. To improve the flexibility and agility, a re-planning method has been developed to address the conditions of machine breakdown and new order arrival. Case studies have been used to a verify the performance and efficiency of the modified PSO algorithm under different criteria. A comparison has been made between the result of the modified PSO algorithm and those of the genetic algorithm (GA) and the simulated annealing (SA) algorithm respectively, and different characteristics of the three algorithms are indicated. Case studies show that the developed PSO can generate satisfactory results in optimising the IPPS problem.

KW - simulated annealing

KW - genetic algorithm

KW - particle swarm

KW - re-planning

KW - optimisation

KW - integrated process planning and scheduling

UR - http://www.scopus.com/inward/record.url?scp=70449632611&partnerID=8YFLogxK

UR - http://dx.doi.org/10.1080/00207540701827905

U2 - 10.1080/00207540701827905

DO - 10.1080/00207540701827905

M3 - Article

VL - 47

SP - 3775

EP - 3796

JO - International Journal of Production Research

JF - International Journal of Production Research

SN - 0020-7543

IS - 14

ER -