SCHEDULING ON A SINGLE-MACHINE WITH A SINGLE BREAKDOWN TO MINIMIZE STOCHASTICALLY THE NUMBER OF TARDY JOBS

被引：0

作者：

ADIRI, I

FROSTIG, E

KAN, AHGR

机构：

[1] HAIFA UNIV,DEPT STAT,HAIFA,ISRAEL

[2] ERASMUS UNIV,INST ECONOMETR,3000 DR ROTTERDAM,NETHERLANDS

来源：

NAVAL RESEARCH LOGISTICS | 1991年 / 38卷 / 02期

关键词：

D O I：

10.1002/1520-6750(199104)38:2<261::AID-NAV3220380210>3.0.CO;2-I

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

Jobs with known processing times and due dates have to be processed on a machine which is subject to a single breakdown. The moment of breakdown and the repair time are independent random variables. Two cases are distinguished with reference to the processing time preempted by the breakdown (no other preemptions are allowed): (i) resumption without time losses and (ii) restart from the beginning. Under certain compatible conditions, we find the policies which minimize stochastically the number of tardy jobs.

引用

页码：261 / 271

页数：11

共 50 条

[41] Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
Wan, Guohua
Yen, Benjamin P. -C.
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 195 (01) : 89 - 97
[42] Single-machine scheduling with trade-off between number of tardy jobs and compression cost
He, Yong
Wei, Qi
Cheng, T. C. E.
[J]. JOURNAL OF SCHEDULING, 2007, 10 (4-5) : 303 - 310
[43] Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
Cheng, TCE
Chen, ZL
Li, CL
[J]. OPERATIONS RESEARCH LETTERS, 1996, 19 (05) : 237 - 242
[44] Single-machine scheduling with trade-off between number of tardy jobs and compression cost
Yong He
Qi Wei
T. C. E. Cheng
[J]. Journal of Scheduling, 2007, 10 : 303 - 310
[45] An improved exact algorithm for single-machine scheduling to minimise the number of tardy jobs with periodic maintenance
Liu, Ming
Wang, Shijin
Chu, Chengbin
Chu, Feng
[J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2016, 54 (12) : 3591 - 3602
[46] Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
Crauwels, HAJ
Potts, CN
VanWassenhove, LN
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 90 (02) : 200 - 213
[47] Algorithms for a two-agent single machine scheduling problem to minimize weighted number of tardy jobs
Li, Jiaji
Gajpal, Yuvraj
Appadoo, Srimantoorao S.
[J]. JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2021, 42 (04): : 785 - 811
[48] Single machine stochastic scheduling to minimize the expected number of tardy jobs using mathematical programming models
Seo, DK
Klein, CA
Jang, W
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2005, 48 (02) : 153 - 161
[49] A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs
T. C. E. Cheng
C. T. Ng
J. J. Yuan
[J]. Journal of Scheduling, 2003, 6 : 551 - 555
[50] A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs
Cheng, TCE
Ng, CT
Yuan, JJ
[J]. JOURNAL OF SCHEDULING, 2003, 6 (06) : 551 - 555

← 1 2 3 4 5 →