A Co-evolutionary Algorithm for Open-shop Scheduling with Disassembly Operations

Yoshitaka Tanimizu, Michisuke Sakamoto, Hideyuki Nonomiya

Research output: Contribution to journalConference article

Abstract

In recent years, many used products are returned from customers through reverse supply chains in order to be reused and recycled. Therefore, it is necessary to provide suitable disassembly procedures from the view point of economic efficiency. This research proposes a scheduling method for open-shop scheduling problems containing both disassembly operations and post-processing operations. A co-evolutionary algorithm is proposed to modify not only the sequences of disassembly and post-processing operations of products but also the sequences of products loaded on disassembly and post-processing machines. Two different kinds of individuals are modeled for both the sequences of operations and the sequences of products in the co-evolutionary algorithm. These individuals alternately repeat evolution at short time intervals, and affect their fitness values each other. We developed a prototype of scheduling system and applied it to some computational experiments for open-shop type scheduling problems including disassembly and post-processing operations. The experimental results of the proposed method were compared with the one of another scheduling method with various heuristic rules in order to evaluate the effectiveness of the proposed method.

Original languageEnglish
Pages (from-to)289-294
Number of pages6
JournalProcedia CIRP
Volume63
DOIs
Publication statusPublished - 2017 Jan 1
Externally publishedYes
Event50th CIRP Conference on Manufacturing Systems, CIRP CMS 2017 - Taichung, Taiwan, Province of China
Duration: 2017 May 32017 May 5

Fingerprint

Evolutionary algorithms
Scheduling
Processing
Supply chains
Economics
Experiments

Keywords

  • Co-evolutionary algorithm
  • Disassembly scheduling
  • Make-span

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Industrial and Manufacturing Engineering

Cite this

A Co-evolutionary Algorithm for Open-shop Scheduling with Disassembly Operations. / Tanimizu, Yoshitaka; Sakamoto, Michisuke; Nonomiya, Hideyuki.

In: Procedia CIRP, Vol. 63, 01.01.2017, p. 289-294.

Research output: Contribution to journalConference article

Tanimizu, Yoshitaka ; Sakamoto, Michisuke ; Nonomiya, Hideyuki. / A Co-evolutionary Algorithm for Open-shop Scheduling with Disassembly Operations. In: Procedia CIRP. 2017 ; Vol. 63. pp. 289-294.
@article{3424c999553041ce86a3bbaaf2d03636,
title = "A Co-evolutionary Algorithm for Open-shop Scheduling with Disassembly Operations",
abstract = "In recent years, many used products are returned from customers through reverse supply chains in order to be reused and recycled. Therefore, it is necessary to provide suitable disassembly procedures from the view point of economic efficiency. This research proposes a scheduling method for open-shop scheduling problems containing both disassembly operations and post-processing operations. A co-evolutionary algorithm is proposed to modify not only the sequences of disassembly and post-processing operations of products but also the sequences of products loaded on disassembly and post-processing machines. Two different kinds of individuals are modeled for both the sequences of operations and the sequences of products in the co-evolutionary algorithm. These individuals alternately repeat evolution at short time intervals, and affect their fitness values each other. We developed a prototype of scheduling system and applied it to some computational experiments for open-shop type scheduling problems including disassembly and post-processing operations. The experimental results of the proposed method were compared with the one of another scheduling method with various heuristic rules in order to evaluate the effectiveness of the proposed method.",
keywords = "Co-evolutionary algorithm, Disassembly scheduling, Make-span",
author = "Yoshitaka Tanimizu and Michisuke Sakamoto and Hideyuki Nonomiya",
year = "2017",
month = "1",
day = "1",
doi = "10.1016/j.procir.2017.03.138",
language = "English",
volume = "63",
pages = "289--294",
journal = "Procedia CIRP",
issn = "2212-8271",
publisher = "Elsevier BV",

}

TY - JOUR

T1 - A Co-evolutionary Algorithm for Open-shop Scheduling with Disassembly Operations

AU - Tanimizu, Yoshitaka

AU - Sakamoto, Michisuke

AU - Nonomiya, Hideyuki

PY - 2017/1/1

Y1 - 2017/1/1

N2 - In recent years, many used products are returned from customers through reverse supply chains in order to be reused and recycled. Therefore, it is necessary to provide suitable disassembly procedures from the view point of economic efficiency. This research proposes a scheduling method for open-shop scheduling problems containing both disassembly operations and post-processing operations. A co-evolutionary algorithm is proposed to modify not only the sequences of disassembly and post-processing operations of products but also the sequences of products loaded on disassembly and post-processing machines. Two different kinds of individuals are modeled for both the sequences of operations and the sequences of products in the co-evolutionary algorithm. These individuals alternately repeat evolution at short time intervals, and affect their fitness values each other. We developed a prototype of scheduling system and applied it to some computational experiments for open-shop type scheduling problems including disassembly and post-processing operations. The experimental results of the proposed method were compared with the one of another scheduling method with various heuristic rules in order to evaluate the effectiveness of the proposed method.

AB - In recent years, many used products are returned from customers through reverse supply chains in order to be reused and recycled. Therefore, it is necessary to provide suitable disassembly procedures from the view point of economic efficiency. This research proposes a scheduling method for open-shop scheduling problems containing both disassembly operations and post-processing operations. A co-evolutionary algorithm is proposed to modify not only the sequences of disassembly and post-processing operations of products but also the sequences of products loaded on disassembly and post-processing machines. Two different kinds of individuals are modeled for both the sequences of operations and the sequences of products in the co-evolutionary algorithm. These individuals alternately repeat evolution at short time intervals, and affect their fitness values each other. We developed a prototype of scheduling system and applied it to some computational experiments for open-shop type scheduling problems including disassembly and post-processing operations. The experimental results of the proposed method were compared with the one of another scheduling method with various heuristic rules in order to evaluate the effectiveness of the proposed method.

KW - Co-evolutionary algorithm

KW - Disassembly scheduling

KW - Make-span

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

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

U2 - 10.1016/j.procir.2017.03.138

DO - 10.1016/j.procir.2017.03.138

M3 - Conference article

VL - 63

SP - 289

EP - 294

JO - Procedia CIRP

JF - Procedia CIRP

SN - 2212-8271

ER -