论文信息 - Determination of an optimal common due date and optimal sequence in a single machine job shop

Determination of an optimal common due date and optimal sequence in a single machine job shop

Abstract In this paper we consider an n jobs one machine sequencing problem in which all jobs have a common due date and a deviation in its completion time occurs when a job is completed before or after the common due date. The objective is to find an optimal value of this common due date and a corresponding optimal sequence such that the mean absolute deviation of the completion times of the jobs in the optimal sequence from the corresponding optimal common due date is at its global minimum. Starting with an arbitrary sequence we relate the problem to a generalized linear goal program from which some basic results are proved using elementary properties of linear equations and a linear goal programming problem. Using these results and the idea of sensitivity analysis in linear programming, an algorithm is developed that determines the optimal due date and the corresponding optimal sequence yielding the global minimum value of the mean absolute deviation of the completion times of the jobs in the optimal s...

C. R. Bector | Y. Gupta | M. C. Gupta

[1] William L. Maxwell,et al. Theory of scheduling , 1967 .

[2] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .

[3] Samuel Eilon,et al. Due dates in job shop scheduling , 1976 .

[4] James K. Weeks,et al. A Methodology for Assigning Minimum Cost Due-Dates , 1977 .

[5] Jwm Will Bertrand,et al. A comparison of due-date selection rules , 1981 .

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

[7] S. S. Panwalkar,et al. Optimal assignment of due-dates for a single processor scheduling problem , 1981 .

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

[9] Don T. Phillips,et al. A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .

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

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

[12] T.C.E. Cheng. A DUALITY APPROACH TO OPTIMAL DUE-DATE DETERMINATION , 1985 .

[13] Jan Karel Lenstra,et al. Sequencing and scheduling : an annotated bibliography , 1997 .

[14] T.C.E. Cheng. Optimal due-date assignment in a job shop† , 1986 .

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