IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v30y2017i3p321-339.html
   My bibliography  Save this article

MILP formulation and genetic algorithm for flow shop scheduling problem with missing operations

Author

Listed:
  • Reza Ramezanian
  • Donya Rahmani

Abstract

The purpose of this research is to formulate and solve general flow shop scheduling problems with missing operations in which the objective function is to minimise the maximum completion time (Makespan). Missing operations assumption refers to the fact that at least one job does not visit one machine. We first propose a mixed integer linear programming (MILP) model for the problem that can generates non-permutation schedules. The MILP Model can be used to compute optimal solution for the small-sized problems. In addition, we have presented an adapted genetic algorithm that can be used to generate non-permutation schedule with relatively good solutions in short computational time. Considering of non-permutation schedules is necessary to pass some machine when we have missing operations assumption. To verify the effectiveness of the presented approach, computational experiments are performed on a set of well-known classical flow shop scheduling (without missing operation) benchmark problems. The results show that the performance of the approach is suitable and can reaches good-quality solutions within a reasonable computational time. Thus, we use the genetic algorithm to solve large-sized flow shop scheduling problems with missing operations.

Suggested Citation

  • Reza Ramezanian & Donya Rahmani, 2017. "MILP formulation and genetic algorithm for flow shop scheduling problem with missing operations," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 30(3), pages 321-339.
    • Handle: RePEc:ids:ijores:v:30:y:2017:i:3:p:321-339
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=87275
    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:ijores:v:30:y:2017:i:3:p:321-339. 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=170 .

    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.