Please use this identifier to cite or link to this item:
Title: A genetic algorithm based heuristic for two machine no-wait flowshop scheduling problems with class setup times that minimizes maximum lateness
Authors: Pang, KW 
Keywords: Genetic algorithm
No-wait flowshop
Class based setup time
Maximum lateness
Issue Date: 2013
Publisher: Elsevier
Source: International journal of production economics, 2013, v. 141, no. 1, p. 127-136 How to cite?
Journal: International journal of production economics 
Abstract: Machine scheduling problem has been extensively studied by researchers for many decades in view of its numerous applications on solving practical problems. Due to the complexity of this class of scheduling problems, various approximation solution approaches have been presented in the literature. In this paper, we present a genetic algorithm (GA) based heuristic approach to solve the problem of two machine no-wait flowshop scheduling problems that the setup time on the machines is class dependent, and the objective is to minimize the maximum lateness of the jobs processed. This class of machine scheduling problems has many practical applications in manufacturing industry, such as metal refinery operations, food processing industry and chemical products production processes, in which no interruption between subsequent processes is allowed and the products can be grouped into families. Extensive computation experiments have been conducted to evaluate the effectiveness of the proposed algorithm. Results show the proposed methodology is suitable to be adopted for the development of an efficient scheduling plan for this class of problems in real life application.
ISSN: 0925-5273
DOI: 10.1016/j.ijpe.2012.06.017
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Citations as of Dec 6, 2017


Last Week
Last month
Citations as of Dec 12, 2017

Page view(s)

Last Week
Last month
Checked on Dec 11, 2017

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.