Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

A Constrained Single Machine Scheduling Model with Earliness/Tardiness and Flow Time Measures

  • Published : 1995.04.01
Download PDF
⟨ Previous Next ⟩

Abstract

This paper considers a single machine nonpreemptive scheduling problem with a given common due date. In the problem, the optimal job sequence is sought to minimize the sum of earliness/tardiness and flow time measures in the situation where all jobs are available at time zero, and weights per unit length of earliness/tardiness and flow time are V and W, respectively. Some dominant solution properties are characterized to deriva both an optimal starting time for an arbitrary sequence and sequence improvement rules. The optimal schedule is found to the case W .geq. V/. By the way, it is difficult to find the optimal schedule for the case W < V. Therefore, the derived properties are put on together to construct a heuristic solution algorithm for the case W < V, and its effectiveness is rated at the mean relative error of about 3% on randomly generated numerical problems.

Keywords

References

  1. Operations Research v.38 Sequencing with Earliness and Tardiness Penalties: A Review Baker,K.R.;G.D.Scudder
  2. Computers and Operations Research v.15 Optimal Common Due-Date with Limited Completion Time Deviation Cheng,T.C.E.
  3. Theory of Scheduling Conway,R.W.;W.L.Maxwell;L.W.Millen
  4. Operations Research v.40 On the Minimization of Completion Time Variance with a Bicriteria Extension De,P.;J.B.Ghosh,;C.E.Wells
  5. Computers and Operations Research v.18 Optimal Common Due-Date with Limited Completion Time Dickman,B.;Y.Wilamowsky;S.Epstein
  6. Naval Research Logistics v.33 Single-and Multiple-Processor Models for Minimizing Completion Time Variance Hall,N.G.
  7. Operations Research v.39 Earliness-Tardiness Scheduling Problem, II : Deviation of Completion times about a Restrictive Common Due Date Hall,N.G.;W.Kubiak;S.P.Sethi
  8. Operations Research v.41 Stochastic Single machine Scheduling with Quardratic Early-Tardy Penalties Mittenthal,J.;M.Raghavachari
  9. Operations Research v.30 Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem Panwalkar,S.S.;M.L.Smith;A.Seidmann
  10. Computers and Operations Research v.19 A Single Machine Scheduling Problem, with Earliness/Tardiness and Starting Time Penalties under a Common Due Date Sung,C.S.;U.G.Joo
  11. Naval Research Logistics v.36 Single-Machine Scheduling to Minimize Absolute Deviation of Completion Times from a Common Due Date Szwarc,W.