计算机科学
调度(生产过程)
作业车间调度
数学优化
启发式
流水车间调度
拖延
单机调度
动态优先级调度
作者
Rong-Hwa Huang,Chang-Lin Yang,H.-T. Huang
标识
DOI:10.1057/jors.2008.184
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI