Minimization of total absolute deviation for a common due date

This study addresses a non-preemptive single-machine scheduling problem with specific penalty parameters for each job in which all jobs have a common due date and zero ready time. Jobs scheduling attempts to minimize the sum of earliness and tardiness (E/T) penalty. Just in Time (JIT) initiated by Toyota in 1960 has since been considered an important notion in an increasingly competitive industrial market. Tardiness is unacceptable, whereas earliness also means waste of resources and increases inventory costs. This study considers a single machine JIT scheduling problem with common due date in a restricted version of the problem with specific penalties. Due to the Non-deterministic Polynomial-time hard property of the problem, solving the problem optimally is impractical. Therefore, this study applies three heuristic algorithms to solve the single machine JIT scheduling problem and compares their computational performance. Data implications are discussed in detail.

[1]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

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

[3]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[4]  Shang-Wang Chang.  A method for quadratic programming , 1986 .

[5]  Hamilton Emmons,et al.  Scheduling to a common due date on parallel uniform processors , 1987 .

[6]  Madabhushi Raghavachari,et al.  A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions , 1993, Comput. Oper. Res..

[7]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[8]  Wlodzimierz Szwarc.  The weighted common due date single machine scheduling problem revisited , 1996, Comput. Oper. Res..

[9]  T. C. Edwin Cheng,et al.  An algorithm for the con due-date determination and sequencing problem , 1987, Comput. Oper. Res..

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

[11]  T.C.E. Cheng,et al.  A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines , 1989 .

[12]  M. Raghavachari.  A V-shape property of optimal schedule of jobs about a common due date , 1986 .

[13]  W. Szwarc.  Single-machine scheduling to minimize absolute deviation of completion times from a common due date , 1989 .

[14]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[15]  Costas P. Pappis,et al.  Scheduling jobs with different, job-dependent earliness and tardiness penalties using the SLK method , 1996 .

[16]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[17]  C. R. Bector,et al.  Determination of an optimal common due date and optimal sequence in a single machine job shop , 1988 .

[18]  Prabuddha De,et al.  On the Multiple-machine Extension to a Common Due-date Assignment and Scheduling Problem , 1991 .

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