Stochastic single-machine scheduling with workload-dependent maintenance activities

被引：3

作者：

Gu, Manzhan ^{[1
]}

Yang, Weitao ^{[1
]}

Liu, Peihai ^{[2
]}

机构：

[1] Shanghai Univ Finance & Econ, Sch Math, Shanghai 200433, Peoples R China

[2] East China Univ Sci & Technol, Sch Math, Shanghai 200237, Peoples R China

来源：

OPTIMIZATION LETTERS | 2024年 / 18卷 / 08期

关键词：

Stochastic scheduling; Maintenance; Markov process; Dynamic programming; VARIABLE MAINTENANCE; FLOW-TIME; SUBJECT; JOBS; BREAKDOWNS; SHOP;

D O I：

10.1007/s11590-024-02102-3

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper studies the stochastic single-machine scheduling problem with workload-dependent maintenance activities, in which the processing times of all jobs are independently subject to a common discrete distribution, and the aim is to find the optimal policy so as to minimize the expected total discounted holding cost. Based on the definition of Markov process, for each of the two cases with the discount rate being zero or a positive number, we present two dynamic programming algorithms to produce the optimal static policy and the optimal dynamic policy, respectively.

引用

页码：1925 / 1947

页数：23

共 28 条

[1] SINGLE-MACHINE FLOW-TIME SCHEDULING WITH A SINGLE BREAKDOWN [J].

ADIRI, I ;

BRUNO, J ;

FROSTIG, E ;

KAN, AHGR .

ACTA INFORMATICA, 1989, 26 (07) :679-685

[2]

Bagga PC., 1970, OPSEARCH, V7, P184

[3]

Ball M, 2007, HBK OPERAT RES MANAG, V14, P1, DOI 10.1016/S0927-0507(06)14001-3

[4]

Cai X., 2014, Optimal Stochastic Scheduling

[5] Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns [J].

Cai, Xiaoqiang ;

Wu, Xianyi ;

Zhou, Xian .

ANNALS OF OPERATIONS RESEARCH, 2021, 298 (1-2) :43-64

[6] Stochastic Scheduling Subject to Preemptive-Repeat Breakdowns with Incomplete Information [J].

Cai, Xiaoqiang ;

Wu, Xianyi ;

Zhou, Xian .

OPERATIONS RESEARCH, 2009, 57 (05) :1236-1249

[7] Stochastic scheduling on parallel machines to minimize discounted holding costs [J].

Cai, Xiaoqiang ;

Wu, Xianyi ;

Zhou, Xian .

JOURNAL OF SCHEDULING, 2009, 12 (04) :375-388

[8] Dynamically optimal policies for stochastic scheduling subject to preemptive-repeat machine breakdowns [J].

Cai, XQ ;

Wu, XY ;

Zhou, X .

IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2005, 2 (02) :158-172

[9] Stochastic scheduling subject to machine breakdowns: The preemptive-repeat model with discounted reward and other criteria [J].

Cai, XQ ;

Sun, XQ ;

Zhou, X .

NAVAL RESEARCH LOGISTICS, 2004, 51 (06) :800-817

[10] On the asymptotic optimality of a simple on-line algorithm for the stochastic single-machine weighted completion time problem and its extensions [J].

Chou, Mabel C. ;

Liu, Hui ;

Queyranne, Maurice ;

Simchi-Levi, David .

OPERATIONS RESEARCH, 2006, 54 (03) :464-474

← 1 2 3 →