Author： Sun J. U.
Publisher： Taylor & Francis Ltd
ISSN： 0305-215X
Source： Engineering Optimization, Vol.41, Iss.6, 2009-06, pp. : 505-520
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
This article addresses a re-entrant job-shop scheduling problem with sequence-dependent setup times. The disjunctive graph model with the objective of the minimum makespan is used to capture the interactions between machines. On the basis of this representation, two heuristic procedures and a genetic algorithm are proposed to obtain near-optimal solutions for this problem. Also, an experimental design method for determining the various genetic parameters based on the Taguchi approach is presented. A comparative study is conducted to examine the performance of these proposed algorithms and the results show that the genetic algorithm outperforms the other heuristic procedures, which are modified versions of recently published existing methods.
Related content
Access to resources
Recommend
Scheduling jobs on parallel machines with sequence-dependent setup times
European Journal of Operational Research, Vol. 100, Iss. 3, 1997-08 ,pp. :
Research of an Improved Genetic Algorithm for Job Shop Scheduling
Advanced Materials Research, Vol. 2014, Iss. 1078, 2015-02 ,pp. :
Integer programming models for the re-entrant shop scheduling problems
Engineering Optimization, Vol. 38, Iss. 5, 2006-07 ,pp. :