Abstract
In this paper we study the unspecified unrelated parallel machine scheduling problem with additional resources. Jobs can be processed at any machine, using a certain number of units of a scarce resource. The objective is to schedule jobs in parallel machines, so that the makespan is minimized, and the use of resources does not exceed a given limit, at any time. We propose an ILP program to solve this problem to optimality. Due to the complexity of the problem, this program explodes for medium-size instances. Therefore, we introduce a heuristic procedure. Both algorithms are tested over a computational experience.
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.