Abstract

In the realm of customized manufacturing, production cycles are often compressed to capture market opportunities swiftly. The blanking system stands as the inaugural and pivotal phase in the realm of large equipment customized manufacturing. This study abstracts a novel problem from real-world blanking systems, as the distributed unrelated parallel machine scheduling with heterogeneous factories and order priorities (DUPMS-HP). The presented work formulates the bi-objective DUPMS-HP, aiming to minimize both the total weighted tardiness and the workload gap of each machine. A learning-based two-phase cooperative optimizer (LCTPO) is introduced to address this NP-hard problem, featuring: i) a cooperative evolutionary algorithm during the first stage for global search to ensure diversity; ii) the incorporation of five problem-specific local search strategies in the first stage to balance priority and due date constraints. Additionally, reinforcement learning is applied to learn and select the best neighborhood search operator for each elite solution, further enhancing diversity. The effectiveness of the proposed algorithm is validated through a comparative analysis with five state-of-the-art algorithms on 20 instances. Experimental results affirm that LCTPO is more adept at solving DUPMS-HP compared to the alternative algorithms.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call