Particle Swarm Optimization method for rescheduling of job processing against machine breakdowns for nondisruptive cell manufacturing system

Wan Ling Li, Tomohiro Murata

研究成果: Conference contribution

2 引用 (Scopus)

抄録

This paper proposes a novel method of reactive scheduling of job processing for non-disruptive cell manufacturing systems (CMS) against unexpected machine breakdown occurrence. Reactive scheduling problem for reassigning pending jobs in CMS is formulated as a discrete optimization problem of Mixed Integer Programming (MIP) and effective solving method of BPSO-SA which is hybridizing method of Binary Particle Swarm Optimization (BPSO) and Simulated Annealing (SA) is proposed to cope with time-critical recovery situation. A Binary Particle Swarm Optimization (BPSO) is adopted to explore near optimal feasible solution of the discrete rescheduling problem, and Simulated Annealing (SA) is used for the global optimization of locating a good approximation to the global optimum in a large search space. Numerical experiment demonstrates the effectiveness of the proposed model through case study problems of non-disruptive jobs processing in CMS with unexpected machine breakdowns to seek for multiple objectives to minimize tardiness, number of intercellular movements, as well as maximizing cell load balancing and the results show that BPSO-SA provides a near optimal solution with significant reducing of calculation time compared with mathematical optimization of MIP method.

元の言語English
ホスト出版物のタイトルProceedings - 2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012
ページ523-528
ページ数6
出版物ステータスPublished - 2012
イベント2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012 - Taipei
継続期間: 2012 10 232012 10 25

Other

Other2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012
Taipei
期間12/10/2312/10/25

Fingerprint

Simulated annealing
Particle swarm optimization (PSO)
Integer programming
Processing
Scheduling
Global optimization
Resource allocation
Recovery
Experiments

ASJC Scopus subject areas

  • Information Systems
  • Software

これを引用

Li, W. L., & Murata, T. (2012). Particle Swarm Optimization method for rescheduling of job processing against machine breakdowns for nondisruptive cell manufacturing system. : Proceedings - 2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012 (pp. 523-528). [6528690]

Particle Swarm Optimization method for rescheduling of job processing against machine breakdowns for nondisruptive cell manufacturing system. / Li, Wan Ling; Murata, Tomohiro.

Proceedings - 2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012. 2012. p. 523-528 6528690.

研究成果: Conference contribution

Li, WL & Murata, T 2012, Particle Swarm Optimization method for rescheduling of job processing against machine breakdowns for nondisruptive cell manufacturing system. : Proceedings - 2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012., 6528690, pp. 523-528, 2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012, Taipei, 12/10/23.
Li WL, Murata T. Particle Swarm Optimization method for rescheduling of job processing against machine breakdowns for nondisruptive cell manufacturing system. : Proceedings - 2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012. 2012. p. 523-528. 6528690
Li, Wan Ling ; Murata, Tomohiro. / Particle Swarm Optimization method for rescheduling of job processing against machine breakdowns for nondisruptive cell manufacturing system. Proceedings - 2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012. 2012. pp. 523-528
@inproceedings{b42f38b924404ff1899cdabad92eb430,
title = "Particle Swarm Optimization method for rescheduling of job processing against machine breakdowns for nondisruptive cell manufacturing system",
abstract = "This paper proposes a novel method of reactive scheduling of job processing for non-disruptive cell manufacturing systems (CMS) against unexpected machine breakdown occurrence. Reactive scheduling problem for reassigning pending jobs in CMS is formulated as a discrete optimization problem of Mixed Integer Programming (MIP) and effective solving method of BPSO-SA which is hybridizing method of Binary Particle Swarm Optimization (BPSO) and Simulated Annealing (SA) is proposed to cope with time-critical recovery situation. A Binary Particle Swarm Optimization (BPSO) is adopted to explore near optimal feasible solution of the discrete rescheduling problem, and Simulated Annealing (SA) is used for the global optimization of locating a good approximation to the global optimum in a large search space. Numerical experiment demonstrates the effectiveness of the proposed model through case study problems of non-disruptive jobs processing in CMS with unexpected machine breakdowns to seek for multiple objectives to minimize tardiness, number of intercellular movements, as well as maximizing cell load balancing and the results show that BPSO-SA provides a near optimal solution with significant reducing of calculation time compared with mathematical optimization of MIP method.",
author = "Li, {Wan Ling} and Tomohiro Murata",
year = "2012",
language = "English",
isbn = "9788994364193",
pages = "523--528",
booktitle = "Proceedings - 2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012",

}

TY - GEN

T1 - Particle Swarm Optimization method for rescheduling of job processing against machine breakdowns for nondisruptive cell manufacturing system

AU - Li, Wan Ling

AU - Murata, Tomohiro

PY - 2012

Y1 - 2012

N2 - This paper proposes a novel method of reactive scheduling of job processing for non-disruptive cell manufacturing systems (CMS) against unexpected machine breakdown occurrence. Reactive scheduling problem for reassigning pending jobs in CMS is formulated as a discrete optimization problem of Mixed Integer Programming (MIP) and effective solving method of BPSO-SA which is hybridizing method of Binary Particle Swarm Optimization (BPSO) and Simulated Annealing (SA) is proposed to cope with time-critical recovery situation. A Binary Particle Swarm Optimization (BPSO) is adopted to explore near optimal feasible solution of the discrete rescheduling problem, and Simulated Annealing (SA) is used for the global optimization of locating a good approximation to the global optimum in a large search space. Numerical experiment demonstrates the effectiveness of the proposed model through case study problems of non-disruptive jobs processing in CMS with unexpected machine breakdowns to seek for multiple objectives to minimize tardiness, number of intercellular movements, as well as maximizing cell load balancing and the results show that BPSO-SA provides a near optimal solution with significant reducing of calculation time compared with mathematical optimization of MIP method.

AB - This paper proposes a novel method of reactive scheduling of job processing for non-disruptive cell manufacturing systems (CMS) against unexpected machine breakdown occurrence. Reactive scheduling problem for reassigning pending jobs in CMS is formulated as a discrete optimization problem of Mixed Integer Programming (MIP) and effective solving method of BPSO-SA which is hybridizing method of Binary Particle Swarm Optimization (BPSO) and Simulated Annealing (SA) is proposed to cope with time-critical recovery situation. A Binary Particle Swarm Optimization (BPSO) is adopted to explore near optimal feasible solution of the discrete rescheduling problem, and Simulated Annealing (SA) is used for the global optimization of locating a good approximation to the global optimum in a large search space. Numerical experiment demonstrates the effectiveness of the proposed model through case study problems of non-disruptive jobs processing in CMS with unexpected machine breakdowns to seek for multiple objectives to minimize tardiness, number of intercellular movements, as well as maximizing cell load balancing and the results show that BPSO-SA provides a near optimal solution with significant reducing of calculation time compared with mathematical optimization of MIP method.

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

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

M3 - Conference contribution

AN - SCOPUS:84880981564

SN - 9788994364193

SP - 523

EP - 528

BT - Proceedings - 2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012

ER -