A hybrid algorithm for earliness-tardiness scheduling problem with sequence dependent setup time

被引：0

作者：

Wang, L ^{[1
]}

Wang, M ^{[1
]}

机构：

[1] Northeastern Univ, Informat Sci & Engn Coll, Shenyang 110006, Peoples R China

来源：

PROCEEDINGS OF THE 36TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-5 | 1997年

关键词：

earliness-tardiness; setup time; genetic algorithm; heuristic;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, we consider single machine earliness-tardiness scheduling problem with sequence dependent setup time under different due dates. The objective is to minimize the penalty function, which includes the penalty of completion time of the job is early or tardy for its due date and the penalty of total setup time between jobs. For this problem, we form a hybrid algorithm by combining the heuristic with a genetic algorithm after giving a heuristic. The results of experiment show this algorithm is efficient.

引用

页码：1219 / 1222

页数：4

共 50 条

[1] Earliness-tardiness scheduling with setup considerations
Sourd, F
[J]. COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (07) : 1849 - 1865
[2] Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints
Sourd, F
[J]. OPERATIONS RESEARCH LETTERS, 2006, 34 (05) : 591 - 598
[3] Note on the sequence dependent setup scheduling problem (SDSSP) with earliness and tardiness penalties
Anderson, Bradley E.
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2014, 78 : 186 - 187
[4] Scheduling with batch setup times and earliness-tardiness penalties
Chen, ZL
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 96 (03) : 518 - 537
[5] A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
Francis Sourd
Safia Kedad-Sidhoum
[J]. Journal of Scheduling, 2008, 11 : 49 - 58
[6] A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
Sourd, Francis
Kedad-Sidhoum, Safia
[J]. JOURNAL OF SCHEDULING, 2008, 11 (01) : 49 - 58
[7] Chemical Reaction Optimization for Earliness-Tardiness Scheduling problem
Cheng, Chen
Tan, Yuejin
He, Renjie
Yao, Feng
[J]. APPLIED SCIENCE, MATERIALS SCIENCE AND INFORMATION TECHNOLOGIES IN INDUSTRY, 2014, 513-517 : 2594 - 2598
[8] A new model for the preemptive earliness-tardiness scheduling problem
Runge, Nina
Sourd, Francis
[J]. COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (07) : 2242 - 2249
[9] Earliness/tardiness scheduling for single machine with sequence dependent setup times
Kim, Minsoo
Seo, Wonchul
Koh, Shiegheun
[J]. ICIC Express Letters, 2015, 9 (12): : 3313 - 3319
[10] Studs mating immigrants in evolutionary algorithm to solve the earliness-tardiness scheduling problem
Pandolf, D
Vilanova, G
De San Pedro, M
Villagra, A
Gallard, RH
[J]. CYBERNETICS AND SYSTEMS, 2002, 33 (04) : 391 - 400

← 1 2 3 4 5 →