Abstract
Motivated by the practical research and development (R&D) process in high-end equipment manufacturing, this study investigates a bi-level scheduling problem in a complex R&D project network, where each project contains multiple modules with a complete task network. In the bi-level scheduling problem, the upper-level problem is that the R&D project leader makes the decision on allocating all R&D project modules to limited R&D researchers and the objective is to minimise the total penalty cost of all projects, and the lower-level problem is that the researchers schedule and sort the assigned tasks to minimise their minimum makespan. The different capacity of researchers is considered, and some structural properties are derived based on the capacity analytics. To tackle this complex scheduling problem, an effective Variable Neighborhood Search algorithm based on the ‘less is more' concept is proposed, where a Multi-Greedy Heuristic is incorporated. Interestingly, we observe that simpler algorithmic strategies may lead to better algorithmic performance. Computational experiments are carried out to demonstrate that the performance of the proposed algorithm is efficient and stable.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.