Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/33088
Title: The three-machine flowshop scheduling problem to minimise maximum lateness with separate setup times
Authors: Ng, CT 
Allahverdi, A
Al-Anzi, FS
Cheng, TCE 
Keywords: Dominance relation
Flowshop
Heuristics
Maximum lateness
Scheduling
Issue Date: 2007
Source: International journal of operational research, 2007, v. 2, no. 2, p. 135-155 How to cite?
Journal: International Journal of Operational Research 
Abstract: We address the three-machine flowshop scheduling problem to minimise maximum lateness, where setup times are considered separate from processing times. We establish a dominance relation for the problem where it specifies which of the two adjacent jobs should precede in an optimal solution. Moreover, we propose three heuristics: Earliest Due Date (EDD), an Enhanced Earliest Due Date (EEDD) and a Polynomial Genetic-based Algorithm (PGA). We conduct computational analysis on randomly generated problems to evaluate the performance of the proposed heuristics. The analysis shows that the performance of EEDD is acceptable if the computational time is of the main concern and the number of jobs are large. The analysis also shows that PGA significantly outperforms EDD and EEDD.
URI: http://hdl.handle.net/10397/33088
ISSN: 1745-7645
DOI: 10.1504/IJOR.2007.012457
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

11
Last Week
0
Last month
0
Citations as of Sep 8, 2017

Page view(s)

75
Last Week
4
Last month
Checked on Sep 17, 2017

Google ScholarTM

Check

Altmetric



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