Single Machine Dcheduling with Maximum Allowable Tardiness in ET Model

최대 지연시간을 고려한 ET 모델에서의 단일 기계 일정계획

  • Published : 1998.03.01

Abstract

This paper addresses the problem of scheduling a set of jobs with a common due data on a single machine. The objective is to minimize the sum of the earliness and tardiness of jobs subject to $T_{max}{\le}{\Delta}\;for{\Delta}{\ge}0$. Properties for the $MAD/T_{max}$ problem are found and the problem is shown to be NP-complete in the ordinary sense. According to the range of Δ, the problem can be solved in polynomial time. Also, some special cases where an optimal schedule is found in polynomial time are discussed.

Keywords

References

  1. Naval Research Logistics Quarterly v.33 Minimiznig Mean Absolute Deviation of Completion Times about a Common Due Date Bagchi, U.;R. S. Sullivan;Y. L. Chang
  2. Naval Research Logostics v.34 Minimizing Absolute and Squared Deviation of Completion Times with Different Earliness and Tardiness Penalties and a Common Due Date Bagchi, U.;R. S. Sullivan;Y. L. Chang
  3. Operations Res v.38 no.1 Sequencing with earliness and tardiness penalties : A Review K.R. Baker;G.D. Scudder
  4. Math. Ops Res. v.10 One-Processor Scheduling with SymmetricEarliness and Tardiness Penalties M. Garey;R. Tarjan;G. Wilfong
  5. Operation Research v.39 no.5 Earliness-Tardiness Scheduling problems,Ⅱ : Deviation of Completion Times about a Restrictive Common Due Date Hall, N. G.;W. Kubiak;S. P. Sethi
  6. Naval Research Logitics Quarterly v.28 Minimizing the Average Deviation of Job Completion times about a Common Due Date Kanet, J.J.
  7. Eur. J. Opnl. Res. v.23 A V-Shape Property of Optimal Schedule of Jobs About a Common Due Date Raghavachari, M.
  8. Naval Research Logitics Quarterly v.31 Minimizig the Sum of Absolute Lateness in Single-Machine and Multimachine Scheduling Sundararaghavan, P. S.;M. U. Ahmed