Self evolution algorithm for common due date scheduling problem

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

1 Citation (Scopus)

Abstract

Inventory cost and delay penalty are two kinds of annoying spendings in manufactory industry. Accordingly, earliness and tardiness penalties are proposed to simulate such scheduling problems where the popular just-in-time (JIT) concept is considered to be of significant importance. In this paper, a self evolution algorithm is proposed to solve the problem of single machine total earliness and tardiness penalties with a common due date. Up to now, such problem has been solved without specific consideration of straddling V-shaped schedules, which may be better than pure V-shaped schedules for early due date problems; without specific discussions on g improving, where g refers to the idle time before the start of the first job; and the many individuals in all so far proposed GA-like algorithms become the bottleneck of execution time reduction. Therefore, in this research, efforts have been made on digging out the straddling V-shaped schedules, improving the efficiency of g improving, and reducing the execution time. In addition, a new RHRM approach is proposed to create the initial solution for evolution, which helps achieve the fast contingency of the algorithm. The performance of the proposed algorithm has been tested on 280 benchmark instances ranging from 10 to 1000 jobs from the OR Library, the results showing that the proposed self evolution algorithm delivers much higher efficiency in finding optimal or near-optimal solutions with both better results in total penalties and significant execution time reduction.

Original languageEnglish
Title of host publication4th IEEE Conference on Automation Science and Engineering, CASE 2008
Pages790-795
Number of pages6
DOIs
Publication statusPublished - 2008
Event4th IEEE Conference on Automation Science and Engineering, CASE 2008 - Washington, DC
Duration: 2008 Aug 232008 Aug 26

Other

Other4th IEEE Conference on Automation Science and Engineering, CASE 2008
CityWashington, DC
Period08/8/2308/8/26

Fingerprint

Scheduling
Costs
Industry

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Weng, W., & Fujimura, S. (2008). Self evolution algorithm for common due date scheduling problem. In 4th IEEE Conference on Automation Science and Engineering, CASE 2008 (pp. 790-795). [4626419] https://doi.org/10.1109/COASE.2008.4626419

Self evolution algorithm for common due date scheduling problem. / Weng, Wei; Fujimura, Shigeru.

4th IEEE Conference on Automation Science and Engineering, CASE 2008. 2008. p. 790-795 4626419.

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

Weng, W & Fujimura, S 2008, Self evolution algorithm for common due date scheduling problem. in 4th IEEE Conference on Automation Science and Engineering, CASE 2008., 4626419, pp. 790-795, 4th IEEE Conference on Automation Science and Engineering, CASE 2008, Washington, DC, 08/8/23. https://doi.org/10.1109/COASE.2008.4626419
Weng W, Fujimura S. Self evolution algorithm for common due date scheduling problem. In 4th IEEE Conference on Automation Science and Engineering, CASE 2008. 2008. p. 790-795. 4626419 https://doi.org/10.1109/COASE.2008.4626419
Weng, Wei ; Fujimura, Shigeru. / Self evolution algorithm for common due date scheduling problem. 4th IEEE Conference on Automation Science and Engineering, CASE 2008. 2008. pp. 790-795
@inproceedings{b2624e99f1a14cedae05c97307085bf8,
title = "Self evolution algorithm for common due date scheduling problem",
abstract = "Inventory cost and delay penalty are two kinds of annoying spendings in manufactory industry. Accordingly, earliness and tardiness penalties are proposed to simulate such scheduling problems where the popular just-in-time (JIT) concept is considered to be of significant importance. In this paper, a self evolution algorithm is proposed to solve the problem of single machine total earliness and tardiness penalties with a common due date. Up to now, such problem has been solved without specific consideration of straddling V-shaped schedules, which may be better than pure V-shaped schedules for early due date problems; without specific discussions on g improving, where g refers to the idle time before the start of the first job; and the many individuals in all so far proposed GA-like algorithms become the bottleneck of execution time reduction. Therefore, in this research, efforts have been made on digging out the straddling V-shaped schedules, improving the efficiency of g improving, and reducing the execution time. In addition, a new RHRM approach is proposed to create the initial solution for evolution, which helps achieve the fast contingency of the algorithm. The performance of the proposed algorithm has been tested on 280 benchmark instances ranging from 10 to 1000 jobs from the OR Library, the results showing that the proposed self evolution algorithm delivers much higher efficiency in finding optimal or near-optimal solutions with both better results in total penalties and significant execution time reduction.",
author = "Wei Weng and Shigeru Fujimura",
year = "2008",
doi = "10.1109/COASE.2008.4626419",
language = "English",
isbn = "9781424420230",
pages = "790--795",
booktitle = "4th IEEE Conference on Automation Science and Engineering, CASE 2008",

}

TY - GEN

T1 - Self evolution algorithm for common due date scheduling problem

AU - Weng, Wei

AU - Fujimura, Shigeru

PY - 2008

Y1 - 2008

N2 - Inventory cost and delay penalty are two kinds of annoying spendings in manufactory industry. Accordingly, earliness and tardiness penalties are proposed to simulate such scheduling problems where the popular just-in-time (JIT) concept is considered to be of significant importance. In this paper, a self evolution algorithm is proposed to solve the problem of single machine total earliness and tardiness penalties with a common due date. Up to now, such problem has been solved without specific consideration of straddling V-shaped schedules, which may be better than pure V-shaped schedules for early due date problems; without specific discussions on g improving, where g refers to the idle time before the start of the first job; and the many individuals in all so far proposed GA-like algorithms become the bottleneck of execution time reduction. Therefore, in this research, efforts have been made on digging out the straddling V-shaped schedules, improving the efficiency of g improving, and reducing the execution time. In addition, a new RHRM approach is proposed to create the initial solution for evolution, which helps achieve the fast contingency of the algorithm. The performance of the proposed algorithm has been tested on 280 benchmark instances ranging from 10 to 1000 jobs from the OR Library, the results showing that the proposed self evolution algorithm delivers much higher efficiency in finding optimal or near-optimal solutions with both better results in total penalties and significant execution time reduction.

AB - Inventory cost and delay penalty are two kinds of annoying spendings in manufactory industry. Accordingly, earliness and tardiness penalties are proposed to simulate such scheduling problems where the popular just-in-time (JIT) concept is considered to be of significant importance. In this paper, a self evolution algorithm is proposed to solve the problem of single machine total earliness and tardiness penalties with a common due date. Up to now, such problem has been solved without specific consideration of straddling V-shaped schedules, which may be better than pure V-shaped schedules for early due date problems; without specific discussions on g improving, where g refers to the idle time before the start of the first job; and the many individuals in all so far proposed GA-like algorithms become the bottleneck of execution time reduction. Therefore, in this research, efforts have been made on digging out the straddling V-shaped schedules, improving the efficiency of g improving, and reducing the execution time. In addition, a new RHRM approach is proposed to create the initial solution for evolution, which helps achieve the fast contingency of the algorithm. The performance of the proposed algorithm has been tested on 280 benchmark instances ranging from 10 to 1000 jobs from the OR Library, the results showing that the proposed self evolution algorithm delivers much higher efficiency in finding optimal or near-optimal solutions with both better results in total penalties and significant execution time reduction.

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

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

U2 - 10.1109/COASE.2008.4626419

DO - 10.1109/COASE.2008.4626419

M3 - Conference contribution

AN - SCOPUS:54949123078

SN - 9781424420230

SP - 790

EP - 795

BT - 4th IEEE Conference on Automation Science and Engineering, CASE 2008

ER -