Stochastic scheduling to minimize expected maximum lateness |
| |
Authors: | Xianyi Wu Xian Zhou |
| |
Affiliation: | 1. Department of Statistics, East China Normal University, Shanghai, PR China;2. Department of Applied Mathematics, The Hong Kong Polytechnic University, Hong Kong, PR China |
| |
Abstract: | This paper is concerned with the problems in scheduling a set of jobs associated with random due dates on a single machine so as to minimize the expected maximum lateness in stochastic environment. This is a difficult problem and few efforts have been reported on its solution in the literature. In this paper, we first derive a deterministic equivalent to the expected maximum lateness and then propose a dynamic programming algorithm to obtain the optimal solutions. The procedures to compute optimal solutions are initially developed in the case of deterministic processing times, and then extended to stochastic processing times following arbitrary probability distributions. Moreover, several heuristic rules are suggested to compute near-optimal solutions, which are shown to be highly efficient and accurate by computer-based experiments. |
| |
Keywords: | Stochastic scheduling Due dates Expected maximum lateness Dynamic programming algorithms |
本文献已被 ScienceDirect 等数据库收录! |
|