Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs

被引：5

作者：

Dourado, Mitre Costa ^{[2
,3
]}

Rodrigues, Rosiane de Freitas ^{[1
,4
]}

Szwarcfiter, Jayme Luiz ^{[5
,6
]}

机构：

[1] Univ Fed Amazonas, DCC ICE, Manaus, Amazonas, Brazil

[2] Univ Fed Rural Rio de Janeiro, ICE, Seropedica, RJ, Brazil

[3] UFRJ, NCE, Rio De Janeiro, Brazil

[4] UFRJ, COPPE, Rio De Janeiro, Brazil

[5] Univ Fed Rio de Janeiro, Inst Matemat, NCE, BR-20010974 Rio De Janeiro, Brazil

[6] Univ Fed Rio de Janeiro, COPPE, BR-20010974 Rio De Janeiro, Brazil

来源：

ANNALS OF OPERATIONS RESEARCH | 2009年 / 169卷 / 01期

关键词：

Algorithms; Graph theory; Parallel machines; Scheduling theory; Tardy jobs; Unit time jobs;

D O I：

10.1007/s10479-008-0479-y

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

Consider a set of n unit time jobs, each one having a release date, a due date, both nonnegative integers, and a weight, a positive real number. Given a set of m parallel machines, we describe an algorithm for finding schedules with minimum weighted number of tardy jobs. The complexity of the proposed algorithm is O(n(2)(1+logm)/m). The best previous algorithm for this problem has complexity O(mn(3)) and employs network flow techniques. Our method is based on a characterization for schedules of this type and employs graph theoretic tools.

引用

页码：81 / 91

页数：11

共 50 条

[1] Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs
Mitre Costa Dourado
Rosiane de Freitas Rodrigues
Jayme Luiz Szwarcfiter
[J]. Annals of Operations Research, 2009, 169 : 81 - 91
[2] Batch scheduling to minimize the weighted number of tardy jobs
Erel, Erdal
Ghosh, Jay B.
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2007, 53 (03) : 394 - 400
[3] Scheduling stochastic jobs on a single machine to minimize weighted number of tardy jobs
Soroush, H. M.
[J]. KUWAIT JOURNAL OF SCIENCE, 2013, 40 (01) : 123 - 147
[4] Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
Wan, Long
Mei, Jiajie
Du, Jiangze
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 290 (01) : 26 - 35
[5] 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
[6] Scheduling linear deteriorating jobs to minimize the number of tardy jobs
Abbasali Jafari
Ghasem Moslehi
[J]. Journal of Global Optimization, 2012, 54 : 389 - 404
[7] Scheduling linear deteriorating jobs to minimize the number of tardy jobs
Jafari, Abbasali
Moslehi, Ghasem
[J]. JOURNAL OF GLOBAL OPTIMIZATION, 2012, 54 (02) : 389 - 404
[8] SEQUENCING TO MINIMIZE WEIGHTED NUMBER OF TARDY JOBS
LAWLER, EL
[J]. REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1976, 10 (05): : 27 - 33
[9] Concurrent open shop scheduling to minimize the weighted number of tardy jobs
Ng, CT
Cheng, TCE
Yuan, JJ
[J]. JOURNAL OF SCHEDULING, 2003, 6 (04) : 405 - 412
[10] Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs
C. T. Ng
T. C. E. Cheng
J. J. Yuan
[J]. Journal of Scheduling, 2003, 6 : 405 - 412

← 1 2 3 4 5 →