Header menu link for other important links
X
Simulated annealing algorithms to minimise the completion time variance of jobs in permutation flowshops
, Krishnaraj J, Pugazhendhi S, Rajendran P, Thiagarajan S
Published in Inderscience Enterprises Ltd.
2019
Volume: 31
   
Issue: 4
Pages: 425 - 451
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. © The Author(s) 2019.
About the journal
JournalInternational Journal of Industrial and Systems Engineering
PublisherInderscience Enterprises Ltd.
ISSN17485037
Open AccessNo
Concepts (12)
  •  related image
    Heuristic algorithms
  •  related image
    Scheduling
  •  related image
    Simulated annealing
  •  related image
    Completion time
  •  related image
    COMPLETION TIME VARIANCE
  •  related image
    COMPUTATIONAL EVALUATION
  •  related image
    PERMUTATION FLOW SHOPS
  •  related image
    PERMUTATION FLOWSHOP SCHEDULING PROBLEMS
  •  related image
    Processing time
  •  related image
    Second phase
  •  related image
    Simulated annealing algorithms
  •  related image
    Job shop scheduling