TY - JOUR
T1 - An iterated greedy algorithm for total flow time minimization in unrelated parallel batch machines with unequal job release times
AU - Arroyo, José Elias C.
AU - Leung, Joseph Y.T.
AU - Tavares, Ricardo Gonçalves
N1 - Funding Information:
The authors would thank the anonymous referees whose suggestions have greatly improved the readability of the paper. The first author thanks the financial support of CNPq and FAPEMIG , Brazilian research agencies.
Publisher Copyright:
© 2018 Elsevier Ltd
PY - 2019/1
Y1 - 2019/1
N2 - This paper investigates the problem of scheduling a set of jobs with arbitrary sizes and non-zero release times on a set of unrelated parallel batch machines with different capacities so as to minimize the total flow time of the jobs. The total flow time, defined as the total amount of time that the jobs spend in the system (i.e. the period between the job release dates and its completion times), is one of the most important objectives in scheduling problems, since it can lead to stable utilization of resources and reduction of working-in-process inventory. Motivated by the computational complexity of the problem, a simple and effective iterated greedy (IG) algorithm is proposed to solve it. The IG algorithm uses an efficient greedy heuristic to reconstruct solutions and a local search procedure to further enhance the solution quality. In attempting to obtain optimal solutions for small-medium size instances, a mixed integer programming model for the problem is also presented. The performance of the proposed algorithm is tested on a comprehensive set of small, medium and large benchmark of randomly generated instances, and is compared to three benchmark meta-heuristic algorithms (Discrete Differential Evolution, Ant Colony Optimization and Simulated Annealing) recently proposed for similar parallel batch machine scheduling problems. Experimental results and statistical tests show that the proposed algorithm is significantly superior in performance than the other algorithms.
AB - This paper investigates the problem of scheduling a set of jobs with arbitrary sizes and non-zero release times on a set of unrelated parallel batch machines with different capacities so as to minimize the total flow time of the jobs. The total flow time, defined as the total amount of time that the jobs spend in the system (i.e. the period between the job release dates and its completion times), is one of the most important objectives in scheduling problems, since it can lead to stable utilization of resources and reduction of working-in-process inventory. Motivated by the computational complexity of the problem, a simple and effective iterated greedy (IG) algorithm is proposed to solve it. The IG algorithm uses an efficient greedy heuristic to reconstruct solutions and a local search procedure to further enhance the solution quality. In attempting to obtain optimal solutions for small-medium size instances, a mixed integer programming model for the problem is also presented. The performance of the proposed algorithm is tested on a comprehensive set of small, medium and large benchmark of randomly generated instances, and is compared to three benchmark meta-heuristic algorithms (Discrete Differential Evolution, Ant Colony Optimization and Simulated Annealing) recently proposed for similar parallel batch machine scheduling problems. Experimental results and statistical tests show that the proposed algorithm is significantly superior in performance than the other algorithms.
KW - Iterated greedy
KW - Local search heuristics
KW - Meta-heuristics
KW - Scheduling
KW - Total flow time
KW - Unrelated parallel batch machines
UR - http://www.scopus.com/inward/record.url?scp=85055893695&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85055893695&partnerID=8YFLogxK
U2 - 10.1016/j.engappai.2018.10.012
DO - 10.1016/j.engappai.2018.10.012
M3 - Article
AN - SCOPUS:85055893695
SN - 0952-1976
VL - 77
SP - 239
EP - 254
JO - Engineering Applications of Artificial Intelligence
JF - Engineering Applications of Artificial Intelligence
ER -