Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times

Document Type

Article

Publication Date

4-1-2017

Abstract

We consider the problem of scheduling a set of n jobs with arbitrary job sizes, processing times and release times on a set of m parallel batch machines with non-identical capacities; the objective is to minimize the makespan. We first present an algorithm to compute a lower bound for the optimal makespan. Based on different rules of batching the jobs and assigning the batches to the machines, several heuristics are proposed to solve the problem. The performance of the proposed heuristics is evaluated by computational experiments. The proposed heuristics are compared against the lower bound and against each other. Our results show that the one of the proposed algorithms outperforms all the other heuristics.

Identifier

85016114577 (Scopus)

Publication Title

Journal of Industrial and Management Optimization

External Full Text Location

https://doi.org/10.3934/jimo.2016057

e-ISSN

1553166X

ISSN

15475816

First Page

977

Last Page

993

Issue

2

Volume

13

Grant

ADXXBZ201509

Fund Ref

National Natural Science Foundation of China

This document is currently not available here.

Share

COinS