Methods of high performance and low complexity in flowshop

Abstract

Every day, companies seek to improve their production process and reduce production costs, thus increasing their efficiency. This work addresses the problem of flowshop scheduling operations programming,programming of operations in flowshop problems, no-idle and no-wait, to minimization makespan and flowtime. From the combination of sorting procedures and re-sequencing, new constructive heuristic methods are obtained. In this study, the performance of the main initial ordering methods is shown as a way of defining advantages and disadvantages in their use as the initiator of constructives and metaheuristics methods. In terms of the quality of the solution, the BN method proved more interesting, independent of the flowshop environment tested. The methods are evaluated using computational experimentation and show high quality solutions when compared with other methods presented in the literature.

Keywords

• Flowshop Permutacional
• No-wait
• No-idle
• Heuristics
• Production program
• Makespan
• Flow Time