IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v5y2010i2p143-158.html
   My bibliography  Save this article

A hybrid genetic algorithm for solving the joint batching and scheduling of a batch processor with earliness and tardiness penalties

Author

Listed:
  • Mohamed Ali Abdel-Fattah Mansour
  • Maged M. Dessouky

Abstract

In this article, we address the problem of minimising the total weighted earliness and tardiness penalties of a batch processor by integrating genetic algorithms and math programming for determining the allocation of the customer orders to production batches and scheduling the resulting batches. Each job has its own unique due date, and earliness and tardiness penalties. A genome representation is introduced for solving the scheduling problem and is evolved by a genetic algorithm while at each evolution, the genome score is evaluated by a mathematical program for determining the job size per batch and the formation of batches. The genetic algorithm's performance is compared with solutions found by a non-linear integer math program solver and its linearised model proposed by Dessouky, Kijowski and Verma (1999) on a set of representative test problems. The developed hybrid genetic algorithm proves its capability and superiority to find good solutions for the problem under consideration and outperforms solutions from a commercial optimisation package, CPLEX.

Suggested Citation

  • Mohamed Ali Abdel-Fattah Mansour & Maged M. Dessouky, 2010. "A hybrid genetic algorithm for solving the joint batching and scheduling of a batch processor with earliness and tardiness penalties," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 5(2), pages 143-158.
    • Handle: RePEc:ids:ijisen:v:5:y:2010:i:2:p:143-158
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=30745
    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.

    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:ijisen:v:5:y:2010:i:2:p:143-158. 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=188 .

    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.