IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v31y2019i4p425-451.html
   My bibliography  Save this article

Simulated annealing algorithms to minimise the completion time variance of jobs in permutation flowshops

Author

Listed:
  • J. Krishnaraj
  • S. Pugazhendhi
  • Chandrasekharan Rajendran
  • S. Thiagarajan

Abstract

In this paper, the permutation flowshop scheduling problem with the objective of minimising the completion time variance (CTV) of jobs is considered, and a simulated annealing algorithm (SA) and two modified SAs (MSA1 and MSA2) are proposed. In the first phase, the proposed algorithms are used to minimise CTV of jobs without any right shifting of completion times of jobs on the last machine (RSCT). As followed in the literature some times, the RSCT (except that of the last job) is attempted in the second phase, and in the third phase, we convert sequences so as to follow the V-shaped property with respect to processing time of jobs on the last machine, followed by RSCT except that of the last job, so that the makespan and the machine utilisation in the shop floor remain the same. We present an extensive computational evaluation of the existing and the proposed heuristic algorithms.

Suggested Citation

  • J. Krishnaraj & S. Pugazhendhi & Chandrasekharan Rajendran & S. Thiagarajan, 2019. "Simulated annealing algorithms to minimise the completion time variance of jobs in permutation flowshops," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 31(4), pages 425-451.
    • Handle: RePEc:ids:ijisen:v:31:y:2019:i:4:p:425-451
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=99188
    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:ijisen:v:31:y:2019:i:4:p:425-451. 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=188 .

    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.