IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v13y2019i1p54-80.html
   My bibliography  Save this article

Flowshop sequence-dependent group scheduling with minimisation of weighted earliness and tardiness

Author

Listed:
  • Taha Keshavarz
  • Nasser Salmasi
  • Mohsen Varmazyar

Abstract

In this research, we approach the flowshop sequence-dependent group scheduling problem with minimisation of total weighted earliness and tardiness as the objective for the first time. A mixed integer linear programming model is developed to solve the problem optimally. Since the proposed research problem is proven to be NP-hard, a hybrid meta-heuristic algorithm based on the particle swarm optimisation (PSO) algorithm, enhanced with neighbourhood search is developed to heuristically solve the problem. Since the objective is a non-regular, a timing algorithm is developed to find the best schedule for each sequence provided by the metaheuristic algorithm. A lower bounding method is also developed by reformulating the problem as a Dantzig-Wolf decomposition model to evaluate the performance of the proposed PSO algorithm. The computational results, based on using available test problems in the literature, demonstrate that the proposed PSO algorithm and the lower bounding method are quite effective, especially in the instances with loose due date. [Received: 17 February 2018; Revised: 27 July 2018; Accepted: 25 August 2018]

Suggested Citation

  • Taha Keshavarz & Nasser Salmasi & Mohsen Varmazyar, 2019. "Flowshop sequence-dependent group scheduling with minimisation of weighted earliness and tardiness," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 13(1), pages 54-80.
    • Handle: RePEc:ids:eujine:v:13:y:2019:i:1:p:54-80
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=97920
    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. He, Xuan & Pan, Quan-Ke & Gao, Liang & Neufeld, Janis S., 2023. "An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem," European Journal of Operational Research, Elsevier, vol. 310(2), pages 597-610.
    2. Wang, Yuhang & Han, Yuyan & Wang, Yuting & Tasgetiren, M. Fatih & Li, Junqing & Gao, Kaizhou, 2023. "Intelligent optimization under the makespan constraint: Rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem," European Journal of Operational Research, Elsevier, vol. 311(3), pages 816-832.

    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:eujine:v:13:y:2019:i:1:p:54-80. 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=210 .

    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.