论文信息 - Single machine scheduling to minimize mean absolute lateness: A heuristic solution

Single machine scheduling to minimize mean absolute lateness: A heuristic solution

Abstract This paper presents a heuristic solution procedure based on the well known methodology of adjacent pairwise interchange (API) to minimize mean absolute lateness (MAL) on a single machine. MAL is a nonregular measure of performance and schedules with inserted machine idle time may contain the global optimal solution. The heuristic solution is compared to the optimal solution for 192 randomly generated problems to investigate the effects of problem size. due date coefficient of variation, and due date lightness on the quality of the heuristic. Results indicate that none of the treatments tested significantly affected the heuristic solution. The heuristic solution was found to average about 2.49% greater than the optimal. Also, the heuristic found the optimal for 122 of the 192 randomly generated test problems.

Ronald D. Armstrong | Timothy D. Fry | L. Drew Rosen

[1] Mesbah U. Ahmed,et al. Minimizing the sum of absolute lateness in single‐machine and multimachine scheduling , 1984 .

[2] J. J. Kanet. Minimizing the average deviation of job completion times about a common due date , 1981 .

[3] Tapan Sen,et al. A state-of-art survey of static scheduling research involving due dates , 1984 .

[4] S. Lakshminarayan,et al. Technical Note - Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties , 1978, Oper. Res..

[5] Sushil K. Gupta,et al. Minimizing a quadratic function of job lateness on a single machine , 1983 .

[6] Yih-Long Chang,et al. Minimizing Mean Squared Deviation of Completion Times About a Common Due Date , 1987 .

[7] Jeffrey B. Sidney,et al. Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties , 1977, Oper. Res..

[8] Richard H. Roth. An Approach to Solving Linear Discrete Optimization Problems , 1970, JACM.

[9] Yih-Long Chang,et al. MINIMIZING MEAN ABSOLUTE DEVIATION OF COMPLETION TIMES ABOUT A COMMON DUE DATE. , 1986 .

[10] J. Blackstone,et al. Minimizing Weighted Absolute Deviation in Single Machine Scheduling , 1987 .

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

[12] S. S. Panwalkar,et al. Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem , 1982, Oper. Res..