Stochastic single-machine scheduling with workload-dependent maintenance activities

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 di...

Full description

Saved in:
Bibliographic Details
Published inOptimization letters Vol. 18; no. 8; pp. 1925 - 1947
Main Authors Gu, Manzhan, Yang, Weitao, Liu, Peihai
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2024
Subjects
Computational Intelligence
Mathematics
Mathematics and Statistics
Numerical and Computational Physics
Operations Research/Decision Theory
Optimization
Original Paper
Simulation
Markov process
Stochastic scheduling
Maintenance
Dynamic programming
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:1862-4472
1862-4480
DOI:10.1007/s11590-024-02102-3