Memorial Self Evolution Algorithm to Solve JIT Machine Scheduling Problem

研究成果: Conference contribution

抄録

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.

本文言語English
ホスト出版物のタイトルProceedings - IEEE INDIN 2008
ホスト出版物のサブタイトル6th IEEE International Conference on Industrial Informatics
ページ1706-1711
ページ数6
DOI
出版ステータスPublished - 2008 10 31
イベントIEEE INDIN 2008: 6th IEEE International Conference on Industrial Informatics - Daejeon, Korea, Republic of
継続期間: 2008 7 132008 7 16

出版物シリーズ

名前IEEE International Conference on Industrial Informatics (INDIN)
ISSN(印刷版)1935-4576

Conference

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

ASJC Scopus subject areas

  • コンピュータ サイエンスの応用
  • 情報システム

フィンガープリント

「Memorial Self Evolution Algorithm to Solve JIT Machine Scheduling Problem」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル