Abstract
Scheduling problems with resource allocation have received much attention in the academic and industrial communities in recent years. This study addresses a parallel‐machine scheduling problem with resource allocation under the objective of minimizing the makespan, where jobs need an additional resource that is allocated to machines in advance. The processing time of jobs is a function of the amount of allocated resources on their corresponding machines. In order to deal with this problem, three decisions must be made, i.e. resource allocation among machines, job assignment on machines, and job sequence on each machine. To solve this problem efficiently, a constructive heuristic approach and a hybrid nested partition method are designed to make these three decisions. Simulation experiments are carried out on a set of instances, and two existing algorithms are chosen to be compared with the proposed algorithms. Experimental results show that the proposed algorithms are promising in coping with this problem. © 2018 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.
Sign-in/Register to access full text options 
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 callMore From: IEEJ Transactions on Electrical and Electronic Engineering
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.
