Loading...
Loading...

Go to the content (press return)

Efficient heuristics for the parallel blocking flow shop scheduling problem

Author
Ribas, I.; Companys, R.; Tort-Martorell, J.
Type of activity
Journal article
Journal
Expert systems with applications
Date of publication
2017-05-15
Volume
74
First page
41
Last page
54
DOI
https://doi.org/10.1016/j.eswa.2017.01.006 Open in new window
Repository
http://hdl.handle.net/2117/100670 Open in new window
URL
http://www.sciencedirect.com/science/article/pii/S0957417417300064 Open in new window
Abstract
We consider the NP-hard problem of scheduling n jobs in F identical parallel flow shops, each consisting of a series of m machines, and doing so with a blocking constraint. The applied criterion is to minimize the makespan, i.e., the maximum completion time of all the jobs in F flow shops (lines). The Parallel Flow Shop Scheduling Problem (PFSP) is conceptually similar to another problem known in the literature as the Distributed Permutation Flow Shop Scheduling Problem (DPFSP), which allows mod...
Citation
Ribas, I., Companys , R., Tort-Martorell, J. Efficient heuristics for the parallel blocking flow shop scheduling problem. "Expert systems with applications", 15 Maig 2017, vol. 74, p. 41-54.
Keywords
Blocking flow shop, Distributed permutation flow shop, Parallel flow shop, Scheduling
Group of research
ADBD - Analysis of Complex Data for Business Decisions
SCOM - Supply Chain and Operations Management

Participants