This paper deals with the problem of makespan minimization in a flow shop with two machines when the input buffer of the second machine can only host a limited number of parts. Here we analyze the problem in the context of batch processing, i.e., when identical parts must be processed consecutively. We propose an exact branch-and-bound algorithm, in which the bounds exploit the batching nature of the problem. Extensive computational results show the effectiveness of the approach, and allow us to compare it with a previous heuristic approach. © 1998 John Wiley & Sons, Inc.
Agnetis, A., Gristina, G., Rossi, F. (1998). Exact algorithms for the batch sequencing problem in a two--machine flow shop with limited buffer. NAVAL RESEARCH LOGISTICS, 45(2), 141-164 [10.1002/(SICI)1520-6750(199803)45:2<141::AID-NAV2>3.0.CO;2-8].
Exact algorithms for the batch sequencing problem in a two--machine flow shop with limited buffer
Agnetis, Alessandro;
1998-01-01
Abstract
This paper deals with the problem of makespan minimization in a flow shop with two machines when the input buffer of the second machine can only host a limited number of parts. Here we analyze the problem in the context of batch processing, i.e., when identical parts must be processed consecutively. We propose an exact branch-and-bound algorithm, in which the bounds exploit the batching nature of the problem. Extensive computational results show the effectiveness of the approach, and allow us to compare it with a previous heuristic approach. © 1998 John Wiley & Sons, Inc.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/7654
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo