Minimizing total weighted tardiness on a single machine with sequence-dependent setup and future ready time

被引：8

作者：

Xi, Yue ^{[1
]}

Jang, Jaejin ^{[1
]}

机构：

[1] Univ Wisconsin, Ind Mfg Engn Dept, Milwaukee, WI 53211 USA

来源：

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY | 2013年 / 67卷 / 1-4期

关键词：

Single machine; Weighted tardiness; Sequence-dependent setup; ATC; Separable setup; COMMON DUE-DATE; SCHEDULING JOB FAMILIES; PARALLEL MACHINES; NEIGHBORHOOD SEARCH; BOUND ALGORITHM; HEURISTIC RULES; SHOPS; PERFORMANCE; PROCESSOR;

D O I：

10.1007/s00170-013-4774-7

中图分类号：

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

学科分类号：

0812 ;

摘要：

This paper minimizes total weighted tardiness on a single machine with sequence-dependent setup time and future ready time. The sequence-dependent setup is classified into two categories: continuous sequence-dependent setup and separable sequence-dependent setup. The former is the conventional type, which needs a part on a machine to setup, while the latter does not. The weighted shortest processing time (WSPT) term, the slack term, and the ready time term of the apparent tardiness cost (ATC)-based rules are analyzed. Two dispatching rules, ATC with ready time and continuous setup (ATCRCS) and ATC with ready time and separable setup (ATCRSS), are proposed for the problems which setup are the continuous type and the separable type, respectively. These new rules are evaluated by the best-of-the-best measure and the territory measure of the performance.

引用

页码：281 / 294

页数：14

共 50 条

[1] Minimizing total weighted tardiness on a single machine with sequence-dependent setup and future ready time
Yue Xi
Jaejin Jang
The International Journal of Advanced Manufacturing Technology, 2013, 67 : 281 - 294
[2] An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
Tanaka, Shunji
Araki, Mituhiko
COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (01) : 344 - 352
[3] A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
Kirlik, Gokhan
Oguz, Ceyda
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (07) : 1506 - 1520
[4] Energy-Efficient Single Machine Total Weighted Tardiness Problem with Sequence-Dependent Setup Times
Tasgetiren, M. Fatih
Oztop, Hande
Eliiyi, Ugur
Eliiyi, Deniz Tursel
Pan, Quan-Ke
INTELLIGENT COMPUTING THEORIES AND APPLICATION, PT I, 2018, 10954 : 746 - 758
[5] Minimizing the sum of maximum earliness and maximum tardiness in the single-machine scheduling problem with sequence-dependent setup time
Nekoiemehr, N.
Moslehi, G.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2011, 62 (07) : 1403 - 1412
[6] An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
Deng, Guanlong
Gu, Xingsheng
INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2014, 45 (03) : 351 - 362
[7] Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times
Jeong, BongJoo
Kim, Yeong-Dae
COMPUTERS & OPERATIONS RESEARCH, 2014, 47 : 72 - 80
[8] A heuristic algorithm to minimize total weighted tardiness on a single machine with release dates and sequence-dependent setup times
Chang, Tzu-Yun
Chou, Fuh-Der
Lee, Ching-En
Journal of the Chinese Institute of Industrial Engineers, 2004, 21 (03): : 289 - 300
[9] Parallel branch-and-price algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times
Speckenmeyer, Philipp
Hilmer, Constanze
Rauchecker, Gerhard
Schryen, Guido
COMPUTERS & OPERATIONS RESEARCH, 2025, 173
[10] An Iterated Local Search heuristic for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times
Subramanian, Anand
Battarra, Maria
Potts, Chris N.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2014, 52 (09) : 2729 - 2742

← 1 2 3 4 5 →