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 条

[31] Single-machine scheduling to stochastically minimize maximum lateness
Xiaoqiang Cai
Liming Wang
Xian Zhou
[J]. Journal of Scheduling, 2007, 10 : 293 - 301
[32] ALGORITHMS FOR SCHEDULING A SINGLE-MACHINE TO MINIMIZE THE WEIGHTED NUMBER OF LATE JOBS
POTTS, CN
VANWASSENHOVE, LN
[J]. MANAGEMENT SCIENCE, 1988, 34 (07) : 843 - 858
[33] A bicriteria approach to minimize number of tardy jobs and resource consumption in scheduling a single machine
Yedidsion, Liron
Shabtay, Dvir
Korach, Ephraim
Kaspi, Moshe
[J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2009, 119 (02) : 298 - 307
[34] Heuristic procedure to minimize number of tardy jobs and total tardiness in single machine scheduling
Suer, Gursel A.
Czajkiewicz, Zbigniew
[J]. Computers and Industrial Engineering, 1992, 23 (1-4): : 145 - 148
[35] SINGLE-MACHINE SCHEDULING AND SELECTION TO MINIMIZE TOTAL FLOW TIME WITH MINIMUM NUMBER TARDY
KYPARISIS, J
DOULIGERIS, C
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1993, 44 (08) : 835 - 838
[36] A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine
Zhao, Qiulan
Yuan, Jinjiang
[J]. OPERATIONS RESEARCH LETTERS, 2019, 47 (06) : 607 - 610
[37] MINIMUM NUMBER OF TARDY JOBS IN SINGLE-MACHINE SCHEDULING WITH RELEASE DATES - AN IMPROVED ALGORITHM
JOHN, TC
WU, YB
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 1987, 12 (03) : 223 - 230
[38] Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs
Zhao, Chuanli
Hsu, Chou-Jung
Cheng, Shuenn-Ren
Yin, Yunqiang
Wu, Chin-Chia
[J]. APPLIED MATHEMATICS AND COMPUTATION, 2014, 248 : 503 - 510
[39] SCHEDULING SEMICONDUCTOR TEST OPERATIONS - MINIMIZING MAXIMUM LATENESS AND NUMBER OF TARDY JOBS ON A SINGLE-MACHINE
UZSOY, R
LEE, CY
MARTINVEGA, LA
[J]. NAVAL RESEARCH LOGISTICS, 1992, 39 (03) : 369 - 388
[40] Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
Cheng, T. C. E.
Ng, C. T.
Yuan, J. J.
[J]. THEORETICAL COMPUTER SCIENCE, 2006, 362 (1-3) : 273 - 281

← 1 2 3 4 5 →