IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v5y2014i4p70-86.html
   My bibliography  Save this article

A Non-Permutation Flow Shop Manufacturing Cell Scheduling Problem with Part's Sequence Dependent Family Setup Times

Author

Listed:
  • Behzad Nikjo

    (Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran)

  • Yaser Zarook

    (Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran)

Abstract

This article presents a new mathematical model for a dynamic flow shop manufacturing cell scheduling problem (DFMCSP) with agreeable job release date for each part family where family setup times are dependent on sequence of parts within families. It means this article considers non-permutation schedules for both sequence of families and sequence of parts within families. The objective is minimizing the Makespan (Cmax). Since, this problem belongs to NP-Hard class. Therefore, reaching an optimal solution in a reasonable computational time by using exact methods is extremely difficult. Thus, this article proposes meta-heuristic methods such as Genetic Algorithms (GA) and Tabu Search (TS). Finally, the computational results compare efficiency of the proposed algorithms under the performance measures.

Suggested Citation

  • Behzad Nikjo & Yaser Zarook, 2014. "A Non-Permutation Flow Shop Manufacturing Cell Scheduling Problem with Part's Sequence Dependent Family Setup Times," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 5(4), pages 70-86, October.
    • Handle: RePEc:igg:jamc00:v:5:y:2014:i:4:p:70-86
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijamc.2014100104
    Download Restriction: no
    ---><---

    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.

    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:igg:jamc00:v:5:y:2014:i:4:p:70-86. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.