Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times

被引：0

作者：

Gerstl, Enrique ^{[1
]}

Mosheiov, Gur ^{[1
]}

机构：

[1] Hebrew Univ Jerusalem, Sch Business Adm, Jerusalem, Israel

来源：

OPTIMIZATION LETTERS | 2024年

关键词：

Scheduling; Single machine; Generalized due-dates; Position-dependent processing times; Minimum number of tardy jobs; SINGLE-MACHINE; SCHEDULING PROBLEMS; PROPORTIONATE FLOWSHOP; TOTAL LOAD;

D O I：

10.1007/s11590-024-02138-5

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We study a single machine scheduling problem with generalized due-dates and general position-dependent job processing times. The objective function is minimum number of tardy jobs. The problem is proved to be NP-hard in the strong sense. We introduce an efficient algorithm that solves medium size problems in reasonable running time. A simple and efficient heuristic is also introduced, which obtained the optimal solution in the vast majority of our tests.

引用

页数：13

共 50 条

[1] Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times
Mosheiov, Gur
Oron, Daniel
[J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (07) : 1601 - 1604
[2] Minimizing the Number of Tardy Jobs with Gammadistributed Processing Times
Li, Haohao
[J]. PROCEEDINGS OF THE 2013 THE INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND SOFTWARE ENGINEERING (ICAISE 2013), 2013, 37 : 161 - 165
[3] Scheduling jobs with stochastic processing times or due dates on a server to minimize the number of tardy jobs
Soroush, H. M.
[J]. 2015 3RD INTERNATIONAL CONFERENCE ON MANUFACTURING ENGINEERING AND TECHNOLOGY FOR MANUFACTURING GROWTH (METMG 2015), 2015, : 16 - 21
[4] Minimizing Tardy Jobs in a Single Machine Scheduling Problem with Fuzzy Processing Times and Due Dates
谢源
谢剑英
[J]. Journal of Donghua University(English Edition), 2005, (04) : 5 - 8
[5] Minimizing the number of tardy jobs with precedence constraints and agreeable due dates
Steiner, G
[J]. DISCRETE APPLIED MATHEMATICS, 1997, 72 (1-2) : 167 - 177
[6] Scheduling jobs with position-dependent processing times
Bachman, A
Janiak, A
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2004, 55 (03) : 257 - 264
[7] Minimizing the number of tardy jobs with stochastically-ordered processing times
Trietsch, Dan
Baker, Kenneth R.
[J]. JOURNAL OF SCHEDULING, 2008, 11 (01) : 71 - 73
[8] Minimizing the number of tardy jobs with stochastically-ordered processing times
Dan Trietsch
Kenneth R. Baker
[J]. Journal of Scheduling, 2008, 11 : 71 - 73
[9] Minimizing the expected number of tardy jobs when processing times are normally distributed
Jang, WS
Klein, CM
[J]. OPERATIONS RESEARCH LETTERS, 2002, 30 (02) : 100 - 106
[10] Single machine scheduling to maximize the number of on-time jobs with generalized due-dates
Gerstl, Enrique
Mosheiov, Gur
[J]. JOURNAL OF SCHEDULING, 2020, 23 (03) : 289 - 299

← 1 2 3 4 5 →