TY - JOUR
AB - © 2018 Elsevier B.V. A two-stage flexible flow shop is considered, where first- and second-stage machines form disjoint pairs, each with a buffer. The buffer capacity varies from pair to pair, and the buffer requirement varies from job to job. Each job is to be assigned to a pair of machines for processing and uses the required amount of buffer from the start till the end of its processing. Operations have equal duration. It is shown that, unless P=NP, no polynomial-time algorithm guarantees a makespan less than 4?3 of the optimal. The paper presents two integer linear programs, compared by means of computational experiments. Both approaches utilise as a subroutine the developed polynomial-time algorithm for the case of equal buffers.
AU - Ernst, A
AU - Fung, J
AU - Singh, G
AU - Zinder, Y
DA - 2019/05/31
DO - 10.1016/j.dam.2018.07.002
EP - 163
JO - Discrete Applied Mathematics
PY - 2019/05/31
SP - 148
TI - Flexible flow shop with dedicated buffers
VL - 261
Y1 - 2019/05/31
Y2 - 2019/12/09
ER -