A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes

Zhao Hong Jia, Joseph Y.T. Leung

Research output: Contribution to journalArticlepeer-review

34 Scopus citations

Abstract

We consider the problem of scheduling a set of n jobs with arbitrary job sizes on a set of m identical and parallel batch machines so as to minimize the makespan. Motivated by the computational complexity of the problem, we propose a meta-heuristic based on the max-min ant system method. Computational experiments are performed with randomly generated test data. The results show that our algorithm outperforms several of the previously studied algorithms.

Original languageEnglish (US)
Pages (from-to)649-665
Number of pages17
JournalEuropean Journal of Operational Research
Volume240
Issue number3
DOIs
StatePublished - 2015

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Keywords

  • Max-min ant system
  • Meta-heuristic
  • NP-hard
  • Parallel batch machines

Fingerprint Dive into the research topics of 'A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes'. Together they form a unique fingerprint.

Cite this