Abstract
This article studies the problem of scheduling independent jobs on parallel machines with a common server, the objective of which is to minimize the makespan. In this case, the common server is responsible for performing the setup operations and, therefore, there must be no conflicts while conducting them. Four alternative time-indexed formulations for the problem are considered and evaluated computationally. Moreover, two algorithms are presented that can significantly improve the performance of the best time-indexed formulation. The results obtained on two benchmark datasets involving up to 100 jobs suggest that the proposed improved algorithms are substantially better than existing approaches.
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 callDisclaimer: 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.
