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

Multi-objective flow shop scheduling problem with stochastic parameters: fuzzy goal programming approach

Author

Listed:
  • Donya Rahmani
  • Reza Ramezanian
  • Mohammad Saidi-Mehrabad

Abstract

Flow shop scheduling problem with stochastic parameters is dealt with in this paper. A multi-objective mixed integer linear programming model is proposed in this concern which can generate non-permutation schedules. To provide a more realistic model, process time and release time are considered stochastic variables with normal distribution. The objective functions are minimising three performance measures including maximum completion time (Makespan), total flow time and total tardiness. Chance constrained programming (CCP) approach and fuzzy goal programming (FGP) are applied to deal with the stochastic parameters and multi-objective function. Due to the complexity of the problem, we have implemented an adapted genetic algorithm to solve large-sized problem. According to the computational experiments, the GA can reach good-quality solutions in reasonable computational time, and can be used to solve large scale problems effectively.

Suggested Citation

  • Donya Rahmani & Reza Ramezanian & Mohammad Saidi-Mehrabad, 2014. "Multi-objective flow shop scheduling problem with stochastic parameters: fuzzy goal programming approach," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 21(3), pages 322-340.
    • Handle: RePEc:ids:ijores:v:21:y:2014:i:3:p:322-340
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=65411
    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. Rossit, Daniel Alejandro & Tohmé, Fernando & Frutos, Mariano, 2018. "The Non-Permutation Flow-Shop scheduling problem: A literature review," Omega, Elsevier, vol. 77(C), pages 143-153.

    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:21:y:2014:i:3:p:322-340. 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.