Minimising total weighted earliness and tardiness penalties on identical parallel machines using a fast ruin-and-recreate algorithm
研究在相同并行机上，针对严格共同交货期，最小化总加权提前与延迟惩罚的调度问题，提出一种快速毁坏与重建算法，在基准测试中优于现有方法。
This paper studies the scheduling problem of minimising total weighted earliness and tardiness penalties on identical parallel machines against a restrictive common due date. This problem is NP-hard in the strong sense and arises in many just-in-time production environments. A fast ruin-and-recreate (FR&R) algorithm is proposed to obtain high-quality solutions to this complex problem. The proposed FR&R algorithm is tested on a well-known set of benchmark test problems that are taken from the literature. Computational results provide evidence of the efficiency of FR&R, which consistently outperform existing algorithms when applied to benchmark instances. This work provides a viable alternative approach for efficiently solving this practical but complex scheduling problem.