Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine

被引：8

作者：

Li, Jinquan ^{[2
]}

Yuan, Xuehai ^{[1
]}

Lee, E. S. ^{[3
]}

Xu, Dehua ^{[4
]}

机构：

[1] Dalian Univ Technol, Sch Control Sci & Engn, Dalian 116024, Liaoning, Peoples R China

[2] Beijing Normal Univ, Res Ctr Fuzzy Syst, Sch Appl Math, Zhuhai 519087, Guangdong, Peoples R China

[3] Kansas State Univ, Dept Ind & Mfg Syst Engn, Manhattan, KS 66506 USA

[4] E China Inst Technol, Sch Sci, Fuzhou 344000, Jiangxi, Peoples R China

来源：

COMPUTERS & MATHEMATICS WITH APPLICATIONS | 2011年 / 62卷 / 11期

基金：

中国国家自然科学基金;

关键词：

Scheduling; Earliness-Tardiness costs; Due date assignment; Customer service level; The weighted possibilistic mean value and variance; RANDOM PROCESSING TIMES; SCHEDULING PROBLEM; PRECEDENCE CONSTRAINTS; FUZZY NUMBERS; SEQUENCING PROBLEM; OPTIMAL ASSIGNMENT; RELEASE DATES; COMMON; PENALTIES; ALGORITHM;

D O I：

10.1016/j.camwa.2011.09.063

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this paper, it is investigated how to sequence jobs with fuzzy processing times and predict their due dates on a single machine such that the total weighted possibilistic mean value of the weighted earliness-tardiness costs is minimized. First, an optimal polynomial time algorithm is put forward for the scheduling problem when there are no precedence constraints among jobs. Moreover, it is shown that if general precedence constraints are involved, the problem is NP-hard. Then, four reduction rules are proposed to simplify the constraints without changing the optimal schedule. Based on these rules, an optimal polynomial time algorithm is proposed when the precedence constraint is a tree or a collection of trees. Finally, a numerical experiment is given. (C) 2011 Elsevier Ltd. All rights reserved.

引用

页码：4126 / 4139

页数：14

共 50 条

[1] Single machine weighted earliness-tardiness penalty problem with a common due date
Mondal, SA
Sen, AK
[J]. COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (07) : 649 - 669
[2] Scheduling a Fuzzy Flowshop Problem to Minimize Weighted Earliness-tardiness
Yan, Ping
Jiao, Ming-hai
Zhao, Li-qiang
[J]. 2013 25TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2013, : 2736 - 2740
[3] Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties
Li, Shi-Sheng
Chen, Ren-Xia
[J]. OPTIMIZATION LETTERS, 2020, 14 (07) : 1681 - 1699
[4] Minimizing the earliness-tardiness costs on a single machine
Rebai, Maher
Kacem, Imed
[J]. 2008 5TH INTERNATIONAL CONFERENCE ON SERVICE SYSTEMS AND SERVICE MANAGEMENT, VOLS 1 AND 2, 2008, : 636 - 640
[5] Minimizing the earliness-tardiness costs on a single machine
Bauman, J
Józefowska, J
[J]. COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (11) : 3219 - 3230
[6] Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models
Alvarez-Valdes, Ramon
Crespo, Enric
Manuel Tamarit, Jose
Villa, Fulgencia
[J]. TOP, 2012, 20 (03) : 754 - 767
[7] Unrelated parallel machine scheduling to minimize total weighted tardiness and earliness
Sophia University
[J]. J. Jpn Ind. Manage. Assoc., 2007, 5 (333-341):
[8] Single machine scheduling to minimize weighted earliness subject to maximum tardiness
Chen, TS
Qi, XT
Tu, FS
[J]. COMPUTERS & OPERATIONS RESEARCH, 1997, 24 (02) : 147 - 152
[9] Single machine scheduling to minimize weighted earliness subject to maximum tardiness
Tsiushuang, Chen
Xiangtong, Qi
Fengsheng, Tu
[J]. Computers and Operations Research, 1997, 24 (02): : 147 - 152
[10] Single machine scheduling to minimize total weighted tardiness
Cheng, TCE
Ng, CT
Yuan, JJ
Liu, ZH
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 165 (02) : 423 - 443

← 1 2 3 4 5 →