Services on Demand
- Cited by SciELO
- Access statistics
Gestão & Produção
Print version ISSN 0104-530XOn-line version ISSN 1806-9649
ARMENTANO, Vinícius Amaral and RONCONI, Débora Pretti. Total tardiness minimization in a flowshop with blocking in-process using tabu search. Gest. Prod. [online]. 2000, vol.7, n.3, pp.352-363. ISSN 0104-530X. http://dx.doi.org/10.1590/S0104-530X2000000300011.
Surveys of production scheduling show that meeting customer due dates is a critical concern in most manufacturing systems. While there is considerable research to minimize the makespan in a flowshop with no storage constraints, very little work has dealt with job total tardiness criterion in a flowshop with blocking in-process. Scheduling problems with blocking arise in serial manufacturing processes where no intermediate buffer storage is available. In this paper we investigate the application of tabu search to this problem in order to explore the solution space. Additional strategies are evaluated. Computational tests are presented and comparisons with the NEH algorithm and with a Branch-and-Bound algorithm are made.
Keywords : scheduling; flowshop with blocking; tabu search.