Minimizing the number of tardy jobs with stochastically-ordered processing times

被引：0

作者：

Dan Trietsch

Kenneth R. Baker

机构：

[1] American University of Armenia,College of Engineering

[2] Dartmouth College,Tuck School

来源：

Journal of Scheduling | 2008年 / 11卷

关键词：

Sequencing; Stochastic scheduling; Polynomial algorithm;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We consider the single-machine sequencing model with stochastic processing times and the problem of minimizing the number of stochastically tardy jobs. In general, this problem is NP-hard. Recently, however, van den Akker and Hoogeveen found some special cases that could be solved in polynomial time. We generalize their findings by providing a polynomial time solution for any stochastically ordered processing times.

引用

页码：71 / 73

页数：2

共 50 条

[1] 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
[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] 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
[4] Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times
Aydilek, Asiye
Aydilek, Harun
Allahverdi, Ali
[J]. APPLIED MATHEMATICAL MODELLING, 2017, 45 : 982 - 996
[5] 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
[6] Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times
Gerstl, Enrique
Mosheiov, Gur
[J]. OPTIMIZATION LETTERS, 2024,
[7] ON THE MINIMIZATION OF THE WEIGHTED NUMBER OF TARDY JOBS WITH RANDOM PROCESSING TIMES AND DEADLINE
DE, P
GHOSH, JB
WELLS, CE
[J]. COMPUTERS & OPERATIONS RESEARCH, 1991, 18 (05) : 457 - 463
[8] Minimizing number of tardy jobs on a batch processing machine with incompatible job families
Jolai, F
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 162 (01) : 184 - 190
[9] Minimizing Number of Tardy Jobs on a Batch Processing Machine with Incompatible Job Families
Liu, Lili
Zhang, Feng
[J]. 2008 ISECS INTERNATIONAL COLLOQUIUM ON COMPUTING, COMMUNICATION, CONTROL, AND MANAGEMENT, VOL 3, PROCEEDINGS, 2008, : 277 - 280
[10] MINIMIZING THE NUMBER OF TARDY JOBS IN IDENTICAL MACHINE SCHEDULING
SUER, GA
BAEZ, E
CZAJKIEWICZ, Z
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 1993, 25 (1-4) : 243 - 246

← 1 2 3 4 5 →