IDEAS home Printed from https://ideas.repec.org/a/ids/ijsoma/v28y2017i3p373-403.html
   My bibliography  Save this article

Mathematical programming and grey wolf optimiser for minimising sum of the total due date assignment, maximum tardiness and delivery costs for a supply chain scheduling problem

Author

Listed:
  • Parisa Assarzadegan
  • Morteza Rasti-Barzoki
  • Hosein Khosroshahi

Abstract

This paper focuses on the integration of the three most important and practical decisions in a supply chain, including due date assignment, production scheduling and outbound distribution. The issue under consideration is to minimise the summation of maximum tardiness, and due date assignment and batch delivery costs. To provide solution methods, first, two mathematical programming models including one mixed nonlinear model and one mixed linear model to solve it are presented. After these developments, since the problem is NP-hard and solving real problems on a large scale is virtually impossible, the combinational meta-heuristic algorithm based on Grey Wolf optimiser (GWO) and heuristic algorithm for solving the problem are presented. The GWO is a fast and robust algorithm in which the number of parameters that should be controlled is few. In this study, various computational tests have also been used to evaluate the effectiveness of the development methods - Taguchi method to set the parameters, design of experiments to generate the experiments, and analysis of variance to analyse the results. The computational results show that the combinational meta-heuristic method introduced in this paper puts in a high performance.

Suggested Citation

  • Parisa Assarzadegan & Morteza Rasti-Barzoki & Hosein Khosroshahi, 2017. "Mathematical programming and grey wolf optimiser for minimising sum of the total due date assignment, maximum tardiness and delivery costs for a supply chain scheduling problem," International Journal of Services and Operations Management, Inderscience Enterprises Ltd, vol. 28(3), pages 373-403.
  • Handle: RePEc:ids:ijsoma:v:28:y:2017:i:3:p:373-403
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=87292
    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:ijsoma:v:28:y:2017:i:3:p:373-403. 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=150 .

    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.