Batch scheduling to minimize the weighted number of tardy jobs

被引：9

作者：

Erel, Erdal ^{[1
]}

Ghosh, Jay B.

机构：

[1] Bilkent Univ, Fac Business Adm, TR-06800 Ankara, Turkey

[2] Apratech, LLC, Los Angeles, CA USA

来源：

COMPUTERS & INDUSTRIAL ENGINEERING | 2007年 / 53卷 / 03期

关键词：

scheduling; batch setup times; dynamic programming; approximation;

D O I：

10.1016/j.cie.2007.03.006

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

In this paper, we address a single-machine scheduling problem with due dates and batch setup times to minimize the weighted number of tardy jobs. We give a pseudo-polynomial dynamic program and a fully-polynomial approximation scheme for the case where the due dates are uniform within. a family. (C) 2007 Elsevier Ltd. All rights reserved.

引用

页码：394 / 400

页数：7

共 50 条

[21] No-wait flowshop scheduling problem to minimize the number of tardy jobs
Aldowaisan, Tariq A.
Allahverdi, Ali
[J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 61 (1-4) : 311 - 323
[22] No-wait flowshop scheduling problem to minimize the number of tardy jobs
Tariq A. Aldowaisan
Ali Allahverdi
[J]. The International Journal of Advanced Manufacturing Technology, 2012, 61 : 311 - 323
[23] Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine
Ren, Jianfeng
Zhang, Yuzhong
Zhang, Xianzhao
Sun, Guo
[J]. COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS, 2009, 5573 : 403 - +
[24] SCHEDULING SHOPS TO MINIMIZE THE WEIGHTED NUMBER OF LATE JOBS
JOZEFOWSKA, J
JURISCH, B
KUBIAK, W
[J]. OPERATIONS RESEARCH LETTERS, 1994, 16 (05) : 277 - 283
[25] On Scheduling a Deteriorating Rate-Modifying Activity to Minimize the Number of Tardy Jobs
Luo, Wen-Chang
[J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2020, 8 (01) : 165 - 175
[26] On Scheduling a Deteriorating Rate-Modifying Activity to Minimize the Number of Tardy Jobs
Wen-Chang Luo
[J]. Journal of the Operations Research Society of China, 2020, 8 : 165 - 175
[27] Two-Machine Flow Shop Scheduling with Common Due Window to Minimize Weighted Number of Early and Tardy Jobs
Yeung, Wing-Kwan
Oguz, Ceyda
Cheng, Tai-Chiu Edwin
[J]. NAVAL RESEARCH LOGISTICS, 2009, 56 (07) : 593 - 599
[28] Common operation scheduling with general processing times: A branch-and-cut algorithm to minimize the weighted number of tardy jobs
Arbib, Claudio
Felici, Giovanni
Servilio, Mara
[J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2019, 84 : 18 - 30
[29] Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs
Chuanli Zhao
[J]. Japan Journal of Industrial and Applied Mathematics, 2016, 33 : 239 - 249
[30] Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs
Zhao, Chuanli
[J]. JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, 2016, 33 (01) : 239 - 249

← 1 2 3 4 5 →