Parallel machine scheduling with common due windows
Authors: Huang, R-H; Yang, C-L; Huang, H-T
Source: Journal of the Operational Research Society, Volume 61, Number 4, 18 April 2010 , pp. 640-646(7)
Publisher: Palgrave Macmillan
Abstract:With the prevalence of on-time scheduling, timely product submission has become a crucial contributor to customer satisfaction. Studies examining on-time scheduling primarily seek to determine the minimum weighted sum of earliness and tardiness penalties. This study assumes that all machines are identical. Furthermore, this study assumes that jobs are independent and share a common due date window when investigating scheduling problems involving parallel machines with a minimum total number of early and tardy jobs (or maximum number of on-time jobs). This study presents related theorems and a novel simplified algorithm based on the problem. Additionally, rule characteristics are examined, and simulated data are used to verify the effectiveness and timeliness of the proposed algorithm. The theoretical proof and data test results all indicate that the proposed approach obtains the best solution within the shortest time.
Document Type: Research article
Publication date: 2010-04-18