论文信息 - Single machine scheduling with deadlines to minimize the weighted number of tardy jobs

Single machine scheduling with deadlines to minimize the weighted number of tardy jobs

This paper considers as single machine scheduling problem in which jobs have due dates and deadlines. A job may be completed after its due date, but not after its deadline, in which case it is tardy. A branch and bound algorithm is proposed to find a schedule which minimizes the weighted number of tardy jobs. It uses lower bounds which are derived using the dynamic programming state-space relaxation method. Computational experience with test problems having up to 300 jobs indicates that the lower bounds are extremely effective in restricting the size of the branch and bound search tree.

A. M. A. Hariri | C. N. Potts | C. Potts | A. Hariri

[1] Paolo Toth,et al. State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

[2] J. M. Moore. An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[3] L. V. Wassenhove,et al. Algorithms for scheduling a single machine to minimize the weighted number of late jobs , 1988 .

[4] B. J. Lageweg,et al. Minimizing Total Costs in One-Machine Scheduling , 1975, Oper. Res..

[5] Eugene L. Lawler,et al. Scheduling a Single Machine to Minimize the Number of Late Jobs , 1983 .

[6] Philip Wolfe,et al. Validation of subgradient optimization , 1974, Math. Program..

[7] J. M. Moore,et al. A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .

[8] T. S. Abdul-Razaq,et al. Dynamic Programming State-Space Relaxation for Single-Machine Scheduling , 1988 .