Dynamic local focusing approach for production scheduling problems

Gu Ping, Lou Yajie, Zhang Xuerui, Shigeru Fujimura

研究成果: Conference contribution

抄録

Although decomposition procedure is a common approach to handle computational complexity which is caused by large scale production scheduling problems, in order to extend the applicability of the decomposition approach, the overall problem should be decomposed on which criterion is always a problem. Also how to improve decomposition approach's computational efficiency and resultant effectiveness is still a challenging task in this field. With the purpose of improving decomposition approach's efficiency and decreasing computational complexity for job shop scheduling problems, a new dynamic local focusing approach which has a machine-based divided criterion focused on the longest active chain is proposed in this paper. Not liking the used decomposition procedure, the proposed one does not decompose a job shop into cells at the very beginning. It dynamically classifies the machines, which process operations on the identified longest active chain of the whole problem as one focused cell (decomposed sub-problem). The schedule is improved by redefining, adjusting and solving the focused cell schedule which is updated iteratively with the entire schedule's longest active chain in this dynamic procedure. The proposed approach is tested on make-span minimum benchmark job shop scheduling problems. Test results show that the algorithm is capable of efficiently generating good schedules.

元の言語English
ホスト出版物のタイトルProceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007
ページ466-471
ページ数6
DOI
出版物ステータスPublished - 2007
イベント3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007 - Scottsdale, AZ
継続期間: 2007 9 222007 9 25

Other

Other3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007
Scottsdale, AZ
期間07/9/2207/9/25

Fingerprint

Scheduling
Decomposition
Computational complexity
Computational efficiency
Job shop scheduling

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

これを引用

Ping, G., Yajie, L., Xuerui, Z., & Fujimura, S. (2007). Dynamic local focusing approach for production scheduling problems. : Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007 (pp. 466-471). [4341798] https://doi.org/10.1109/COASE.2007.4341798

Dynamic local focusing approach for production scheduling problems. / Ping, Gu; Yajie, Lou; Xuerui, Zhang; Fujimura, Shigeru.

Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007. 2007. p. 466-471 4341798.

研究成果: Conference contribution

Ping, G, Yajie, L, Xuerui, Z & Fujimura, S 2007, Dynamic local focusing approach for production scheduling problems. : Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007., 4341798, pp. 466-471, 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007, Scottsdale, AZ, 07/9/22. https://doi.org/10.1109/COASE.2007.4341798
Ping G, Yajie L, Xuerui Z, Fujimura S. Dynamic local focusing approach for production scheduling problems. : Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007. 2007. p. 466-471. 4341798 https://doi.org/10.1109/COASE.2007.4341798
Ping, Gu ; Yajie, Lou ; Xuerui, Zhang ; Fujimura, Shigeru. / Dynamic local focusing approach for production scheduling problems. Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007. 2007. pp. 466-471
@inproceedings{9513c552a42e4498b83939960e32260b,
title = "Dynamic local focusing approach for production scheduling problems",
abstract = "Although decomposition procedure is a common approach to handle computational complexity which is caused by large scale production scheduling problems, in order to extend the applicability of the decomposition approach, the overall problem should be decomposed on which criterion is always a problem. Also how to improve decomposition approach's computational efficiency and resultant effectiveness is still a challenging task in this field. With the purpose of improving decomposition approach's efficiency and decreasing computational complexity for job shop scheduling problems, a new dynamic local focusing approach which has a machine-based divided criterion focused on the longest active chain is proposed in this paper. Not liking the used decomposition procedure, the proposed one does not decompose a job shop into cells at the very beginning. It dynamically classifies the machines, which process operations on the identified longest active chain of the whole problem as one focused cell (decomposed sub-problem). The schedule is improved by redefining, adjusting and solving the focused cell schedule which is updated iteratively with the entire schedule's longest active chain in this dynamic procedure. The proposed approach is tested on make-span minimum benchmark job shop scheduling problems. Test results show that the algorithm is capable of efficiently generating good schedules.",
author = "Gu Ping and Lou Yajie and Zhang Xuerui and Shigeru Fujimura",
year = "2007",
doi = "10.1109/COASE.2007.4341798",
language = "English",
isbn = "1424411548",
pages = "466--471",
booktitle = "Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007",

}

TY - GEN

T1 - Dynamic local focusing approach for production scheduling problems

AU - Ping, Gu

AU - Yajie, Lou

AU - Xuerui, Zhang

AU - Fujimura, Shigeru

PY - 2007

Y1 - 2007

N2 - Although decomposition procedure is a common approach to handle computational complexity which is caused by large scale production scheduling problems, in order to extend the applicability of the decomposition approach, the overall problem should be decomposed on which criterion is always a problem. Also how to improve decomposition approach's computational efficiency and resultant effectiveness is still a challenging task in this field. With the purpose of improving decomposition approach's efficiency and decreasing computational complexity for job shop scheduling problems, a new dynamic local focusing approach which has a machine-based divided criterion focused on the longest active chain is proposed in this paper. Not liking the used decomposition procedure, the proposed one does not decompose a job shop into cells at the very beginning. It dynamically classifies the machines, which process operations on the identified longest active chain of the whole problem as one focused cell (decomposed sub-problem). The schedule is improved by redefining, adjusting and solving the focused cell schedule which is updated iteratively with the entire schedule's longest active chain in this dynamic procedure. The proposed approach is tested on make-span minimum benchmark job shop scheduling problems. Test results show that the algorithm is capable of efficiently generating good schedules.

AB - Although decomposition procedure is a common approach to handle computational complexity which is caused by large scale production scheduling problems, in order to extend the applicability of the decomposition approach, the overall problem should be decomposed on which criterion is always a problem. Also how to improve decomposition approach's computational efficiency and resultant effectiveness is still a challenging task in this field. With the purpose of improving decomposition approach's efficiency and decreasing computational complexity for job shop scheduling problems, a new dynamic local focusing approach which has a machine-based divided criterion focused on the longest active chain is proposed in this paper. Not liking the used decomposition procedure, the proposed one does not decompose a job shop into cells at the very beginning. It dynamically classifies the machines, which process operations on the identified longest active chain of the whole problem as one focused cell (decomposed sub-problem). The schedule is improved by redefining, adjusting and solving the focused cell schedule which is updated iteratively with the entire schedule's longest active chain in this dynamic procedure. The proposed approach is tested on make-span minimum benchmark job shop scheduling problems. Test results show that the algorithm is capable of efficiently generating good schedules.

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

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

U2 - 10.1109/COASE.2007.4341798

DO - 10.1109/COASE.2007.4341798

M3 - Conference contribution

AN - SCOPUS:44449154448

SN - 1424411548

SN - 9781424411542

SP - 466

EP - 471

BT - Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007

ER -