Operations Research Transactions ›› 2025, Vol. 29 ›› Issue (1): 142-158.doi: 10.15960/j.cnki.issn.1007-6093.2025.01.012

Previous Articles     Next Articles

Stochastic scheduling to minimize the expected total number of tardy jobs with machine maintenance activities

Shipian DU1, Manzhan GU1,*()   

  1. 1. School of Mathematics, Shanghai University of Finance and Economics, Shanghai 200433, China
  • Received:2021-12-24 Online:2025-03-15 Published:2025-03-08
  • Contact: Manzhan GU E-mail:gu.manzhan@mail.shufe.edu.cn

Abstract:

This paper studies the single machine stochastic scheduling problem with multiple machine maintenance activities, where all the jobs have the same processing time and due date which is a random variable. The goal is to determine the number of workshops and the number of jobs processed in each workshop so as to minimize the expected total number of tardy jobs. In the case where the due date follows the exponential distribution and the maintenance time function is concave, some properties of the optimal schedule are introduced, based on which the optimal schedule is proposed. Moreover, an optimal algorithm is proposed in the case where the due date follows the uniform distribution and the maintenance time function is a linear function.

Key words: stochastic scheduling, machine maintenance, the expected total number of tardy jobs, exponential distribution, uniform distribution

CLC Number: