An adaptive penalty guided genetic algorithm for scheduling parallel batch processing machines

Shubin Xu

International Journal of Applied Management Science, 2018, vol. 10, issue 3, 247-268

Abstract: We study the problem of scheduling a set of jobs with non-identical capacity requirements on parallel non-identical batch processing machines to minimise the makespan. We formulate the problem as a nonlinear integer programming model. Given that this problem is NP-hard, we propose a genetic algorithm to heuristically solve it. An adaptive penalty is combined to guide the search process to explore promising feasible and infeasible regions. Random problem instances were generated to test the approach with respect to solution quality and run time. Computational results demonstrate the effectiveness of the proposed algorithm.

Keywords: scheduling; parallel machines; batch processing machines; makespan; mathematical programming; heuristics; genetic algorithms; penalty function. (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=93784 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:injams:v:10:y:2018:i:3:p:247-268

Access Statistics for this article

More articles in International Journal of Applied Management Science from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().