Minimization of total absolute deviation for a common due date

Abstract

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.

Keywords:

• Scheduling
• JIT
• Heuristics