Memorial Self Evolution Algorithm to Solve JIT Machine Scheduling Problem

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The Just-In-Time (JIT) concept is of great importance in many manufacturing processes. JIT scheduling problems affects the performance of the whole production procedure, because early in job completion causes inventory cost while delay in job completion raises penalties paid to customers. In this paper, a memorial self evolution algorithm is proposed to solve the problem of total earliness and tardiness penalties on a machine unit with a common due date. Up to now, researches on this problem have paid no specific attention to straddling V-shaped schedules, which may be better than pure V-shaped schedules for early due date cases; and no specific discussions have been made on the start time setting of the first job in a schedule. Thus, efforts have been made on searching good straddling V-shaped schedules, and optimizing start time setting of schedules. A GHRM approach is proposed to create the initial solution for memorial self evolution. Meanwhile a database which keeps the memories of the elite solutions is introduced to deliver better initial solutions for similar problems. The performance of the proposed algorithm has been tested on 280 benchmark instances ranging from 10 to 1000 jobs. The results show that the proposed memorial self evolution algorithm delivers better results in in finding optimal or near-optimal solutions than previous researches.

Original languageEnglish
Title of host publicationIEEE International Conference on Industrial Informatics (INDIN)
Pages1706-1711
Number of pages6
DOIs
Publication statusPublished - 2008
EventIEEE INDIN 2008: 6th IEEE International Conference on Industrial Informatics - Daejeon
Duration: 2008 Jul 132008 Jul 16

Other

OtherIEEE INDIN 2008: 6th IEEE International Conference on Industrial Informatics
CityDaejeon
Period08/7/1308/7/16

Fingerprint

Scheduling
Data storage equipment
Costs

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Cite this

Wei, W., & Fujimura, S. (2008). Memorial Self Evolution Algorithm to Solve JIT Machine Scheduling Problem. In IEEE International Conference on Industrial Informatics (INDIN) (pp. 1706-1711). [4618378] https://doi.org/10.1109/INDIN.2008.4618378

Memorial Self Evolution Algorithm to Solve JIT Machine Scheduling Problem. / Wei, Weng; Fujimura, Shigeru.

IEEE International Conference on Industrial Informatics (INDIN). 2008. p. 1706-1711 4618378.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Wei, W & Fujimura, S 2008, Memorial Self Evolution Algorithm to Solve JIT Machine Scheduling Problem. in IEEE International Conference on Industrial Informatics (INDIN)., 4618378, pp. 1706-1711, IEEE INDIN 2008: 6th IEEE International Conference on Industrial Informatics, Daejeon, 08/7/13. https://doi.org/10.1109/INDIN.2008.4618378
Wei W, Fujimura S. Memorial Self Evolution Algorithm to Solve JIT Machine Scheduling Problem. In IEEE International Conference on Industrial Informatics (INDIN). 2008. p. 1706-1711. 4618378 https://doi.org/10.1109/INDIN.2008.4618378
Wei, Weng ; Fujimura, Shigeru. / Memorial Self Evolution Algorithm to Solve JIT Machine Scheduling Problem. IEEE International Conference on Industrial Informatics (INDIN). 2008. pp. 1706-1711
@inproceedings{e72d99c3a6404a319cf1cb683c736458,
title = "Memorial Self Evolution Algorithm to Solve JIT Machine Scheduling Problem",
abstract = "The Just-In-Time (JIT) concept is of great importance in many manufacturing processes. JIT scheduling problems affects the performance of the whole production procedure, because early in job completion causes inventory cost while delay in job completion raises penalties paid to customers. In this paper, a memorial self evolution algorithm is proposed to solve the problem of total earliness and tardiness penalties on a machine unit with a common due date. Up to now, researches on this problem have paid no specific attention to straddling V-shaped schedules, which may be better than pure V-shaped schedules for early due date cases; and no specific discussions have been made on the start time setting of the first job in a schedule. Thus, efforts have been made on searching good straddling V-shaped schedules, and optimizing start time setting of schedules. A GHRM approach is proposed to create the initial solution for memorial self evolution. Meanwhile a database which keeps the memories of the elite solutions is introduced to deliver better initial solutions for similar problems. The performance of the proposed algorithm has been tested on 280 benchmark instances ranging from 10 to 1000 jobs. The results show that the proposed memorial self evolution algorithm delivers better results in in finding optimal or near-optimal solutions than previous researches.",
author = "Weng Wei and Shigeru Fujimura",
year = "2008",
doi = "10.1109/INDIN.2008.4618378",
language = "English",
isbn = "9781424421718",
pages = "1706--1711",
booktitle = "IEEE International Conference on Industrial Informatics (INDIN)",

}

TY - GEN

T1 - Memorial Self Evolution Algorithm to Solve JIT Machine Scheduling Problem

AU - Wei, Weng

AU - Fujimura, Shigeru

PY - 2008

Y1 - 2008

N2 - The Just-In-Time (JIT) concept is of great importance in many manufacturing processes. JIT scheduling problems affects the performance of the whole production procedure, because early in job completion causes inventory cost while delay in job completion raises penalties paid to customers. In this paper, a memorial self evolution algorithm is proposed to solve the problem of total earliness and tardiness penalties on a machine unit with a common due date. Up to now, researches on this problem have paid no specific attention to straddling V-shaped schedules, which may be better than pure V-shaped schedules for early due date cases; and no specific discussions have been made on the start time setting of the first job in a schedule. Thus, efforts have been made on searching good straddling V-shaped schedules, and optimizing start time setting of schedules. A GHRM approach is proposed to create the initial solution for memorial self evolution. Meanwhile a database which keeps the memories of the elite solutions is introduced to deliver better initial solutions for similar problems. The performance of the proposed algorithm has been tested on 280 benchmark instances ranging from 10 to 1000 jobs. The results show that the proposed memorial self evolution algorithm delivers better results in in finding optimal or near-optimal solutions than previous researches.

AB - The Just-In-Time (JIT) concept is of great importance in many manufacturing processes. JIT scheduling problems affects the performance of the whole production procedure, because early in job completion causes inventory cost while delay in job completion raises penalties paid to customers. In this paper, a memorial self evolution algorithm is proposed to solve the problem of total earliness and tardiness penalties on a machine unit with a common due date. Up to now, researches on this problem have paid no specific attention to straddling V-shaped schedules, which may be better than pure V-shaped schedules for early due date cases; and no specific discussions have been made on the start time setting of the first job in a schedule. Thus, efforts have been made on searching good straddling V-shaped schedules, and optimizing start time setting of schedules. A GHRM approach is proposed to create the initial solution for memorial self evolution. Meanwhile a database which keeps the memories of the elite solutions is introduced to deliver better initial solutions for similar problems. The performance of the proposed algorithm has been tested on 280 benchmark instances ranging from 10 to 1000 jobs. The results show that the proposed memorial self evolution algorithm delivers better results in in finding optimal or near-optimal solutions than previous researches.

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

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

U2 - 10.1109/INDIN.2008.4618378

DO - 10.1109/INDIN.2008.4618378

M3 - Conference contribution

AN - SCOPUS:54849408173

SN - 9781424421718

SP - 1706

EP - 1711

BT - IEEE International Conference on Industrial Informatics (INDIN)

ER -