Premium
Job scheduling and resource allocation in parallel‐machine system via a hybrid nested partition method
Author(s) -
Fu Yaping,
Jiang Guanjie,
Tian Guangdong,
Wang Zhenling
Publication year - 2019
Publication title -
ieej transactions on electrical and electronic engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.254
H-Index - 30
eISSN - 1931-4981
pISSN - 1931-4973
DOI - 10.1002/tee.22842
Subject(s) - computer science , job shop scheduling , partition (number theory) , scheduling (production processes) , mathematical optimization , distributed computing , constructive , partition problem , resource allocation , operations research , schedule , engineering , mathematics , computer network , process (computing) , combinatorics , operating system
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.