IDEAS home Printed from https://ideas.repec.org/a/ids/injams/v10y2018i3p247-268.html
   My bibliography  Save this article

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

Author

Listed:
  • Shubin Xu

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.

Suggested Citation

  • Shubin Xu, 2018. "An adaptive penalty guided genetic algorithm for scheduling parallel batch processing machines," International Journal of Applied Management Science, Inderscience Enterprises Ltd, vol. 10(3), pages 247-268.
    • Handle: RePEc:ids:injams:v:10:y:2018:i:3:p:247-268
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=93784
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:injams:v:10:y:2018:i:3:p:247-268. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=286 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.