Loading...
Loading...

Go to the content (press return)

Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization

Author
Ribas, I.; Companys, R.
Type of activity
Journal article
Journal
Computers and industrial engineering
Date of publication
2015-05-01
Volume
87
First page
30
Last page
39
DOI
https://doi.org/10.1016/j.cie.2015.04.013 Open in new window
Repository
http://hdl.handle.net/2117/28346 Open in new window
URL
http://www.sciencedirect.com/science/article/pii/S036083521500162X Open in new window
Abstract
This paper proposes two constructive heuristics, i.e. HPF1 and HPF2, for the blocking flow shop problem in order to minimize the total flow time. They differ mainly in the criterion used to select the first job in the sequence since, as it is shown, its contribution to the total flow time is not negligible. Both procedures were combined with the insertion phase of NEH to improve the sequence. However, as the insertion procedure does not always improve the solution, in the resulting heuristics, n...
Citation
Ribas, I.; Companys , R. Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization. "Computers and industrial engineering", 01 Maig 2015, vol. 87, p. 30-39.
Keywords
Blocking, Flow shop, Heuristics, Scheduling, Total flow time
Group of research
SCOM - Supply Chain and Operations Management

Participants

Attachments