Effective heuristic for makespan minimization in parallel batch machines with non-identical capacities

Document Type

Article

Publication Date

11-1-2015

Abstract

We consider the problem of scheduling a set of n jobs with arbitrary job sizes on a set of m parallel batch machines with non-identical capacities; the objective is to minimize the makespan. The problem is known to be NP-hard. A heuristic based on the First-Fit-Decreasing (FFD) rule is presented as well as a meta-heuristic based on Max-Min Ant System (MMAS). The performances of the two heuristics are compared with a previously studied heuristic by computational experiments. The results show that both proposed algorithms outperform the previously studied heuristic. Moreover, the MMAS heuristic obtains better solutions compared with the FFD heuristic.

Identifier

84942788341 (Scopus)

Publication Title

International Journal of Production Economics

External Full Text Location

https://doi.org/10.1016/j.ijpe.2015.07.021

ISSN

09255273

First Page

1

Last Page

10

Volume

169

Grant

71131002

Fund Ref

National Natural Science Foundation of China

This document is currently not available here.

Share

COinS