Single machine scheduling to minimize job-dependent weighted earliness and tardiness penalties with distinct release dates

• Main Authors: Jeou-jer Luo, 羅久哲
• Other Authors: Gwo-ji Sheen
• Format: Others
• Language: en_US
• Published: 2005
• Online Access: http://ndltd.ncl.edu.tw/handle/07770307802136678919

碩士 === 國立中央大學 === 工業管理研究所 === 93 === We consider a single machine scheduling problem to minimize job-dependent weighted earliness and tardiness penalties with distinct release dates. Each of n jobs is to be processed without interruption on a single machine which can handle only one job at a time. In our problem, each job becomes available for processing at its release date. All jobs have common due date and each job has different weights for earliness and tardiness. The objective is to find an optimal schedule that minimizes the sum of job-dependent earliness and job-dependent tardiness. For this problem, a branch-and-Bound Algorithm is proposed to find an optimal schedule in this article, and some propositions are used to eliminate a large of infeasible solutions. Computational experiments are proposed to validate and evaluate our algorithm. In validation, a special case and enumeration are compared with our algorithm. In evaluation, we compare effectiveness between our algorithm and enumeration. In average, more than 99% of nodes are eliminated in test problems.