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 publicationProceedings - IEEE INDIN 2008
Subtitle of host publication6th IEEE International Conference on Industrial Informatics
Pages1706-1711
Number of pages6
DOIs
Publication statusPublished - 2008 Oct 31
EventIEEE INDIN 2008: 6th IEEE International Conference on Industrial Informatics - Daejeon, Korea, Republic of
Duration: 2008 Jul 132008 Jul 16

Publication series

NameIEEE International Conference on Industrial Informatics (INDIN)
ISSN (Print)1935-4576

Conference

ConferenceIEEE INDIN 2008: 6th IEEE International Conference on Industrial Informatics
CountryKorea, Republic of
CityDaejeon
Period08/7/1308/7/16

    Fingerprint

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Cite this

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