Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1033307 | Omega | 2009 | 10 Pages |
Abstract
The flowshop scheduling problem with blocking in-process is addressed in this paper. In this environment, there are no buffers between successive machines; therefore intermediate queues of jobs waiting in the system for their next operations are not allowed. Heuristic approaches are proposed to minimize the total tardiness criterion. A constructive heuristic that explores specific characteristics of the problem is presented. Moreover, a GRASP-based heuristic is proposed and coupled with a path relinking strategy to search for better outcomes. Computational tests are presented and the comparisons made with an adaptation of the NEH algorithm and with a branch-and-bound algorithm indicate that the new approaches are promising.
Related Topics
Social Sciences and Humanities
Business, Management and Accounting
Strategy and Management
Authors
Débora P. Ronconi, Luís R.S. Henriques,