IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/3124182.html
   My bibliography  Save this article

Scheduling Batch Processing Machine Using Max–Min Ant System Algorithm Improved by a Local Search Method

Author

Listed:
  • XiaoLin Li
  • Yu Wang

Abstract

The problem of minimizing the makespan on single batch processing machine is studied in this paper. Both job sizes and processing time are nonidentical and the processing time of each batch is determined by the job with the longest processing time in the batch. Max–Min Ant System (MMAS) algorithm is developed to solve the problem. A local search method MJE (Multiple Jobs Exchange) is proposed to improve the performance of the algorithm by adjusting jobs between batches. Preliminary experiment is conducted to determine the parameters of MMAS. The performance of the proposed MMAS algorithm is compared with CPLEX as well as several other algorithms including ant cycle (AC) algorithm, genetic algorithm (GA), and two heuristics, First Fit Longest Processing Time (FFLPT) and Best Fit Longest Processing Time (BFLPT), through numerical experiment. The experiment results show that MMAS outperformed others especially for large population size.

Suggested Citation

  • XiaoLin Li & Yu Wang, 2018. "Scheduling Batch Processing Machine Using Max–Min Ant System Algorithm Improved by a Local Search Method," Mathematical Problems in Engineering, Hindawi, vol. 2018, pages 1-10, January.
    • Handle: RePEc:hin:jnlmpe:3124182
    DOI: 10.1155/2018/3124182
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2018/3124182.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2018/3124182.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2018/3124182?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlmpe:3124182. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.