A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking |
| |
Authors: | Débora P Ronconi |
| |
Institution: | 1. Departamento de Engenharia de Produ??o, Escola Politécnica, Universidade de S?o Paulo, Av. Prof. Almeida Prado 128, Cidade Universitária, 05508-900, S?o, Paulo-SP, Brazil
|
| |
Abstract: | This work addresses the minimization of the makespan criterion for the flowshop problem with blocking. In this environment
there are no buffers between successive machines, and therefore intermediate queues of jobs waiting in the system for their
next operations are not allowed. We propose a lower bound which exploits the occurrence of blocking. A branch-and-bound algorithm
that uses this lower bound is described and its efficiency is evaluated on several problems. Results of computational experiments
are reported. |
| |
Keywords: | flowshop blocking makespan lower bound branch-and-bound |
本文献已被 SpringerLink 等数据库收录! |
|