Heuristic approaches to solve a two-stage lot sizing and scheduling problem
| Autor: | Gustavo Valentim Loch, Talita Mariana Pinho Schimidt, Scarpin Cassius Tadeu, Cleder Marcos Schenekemberg |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Development environment
0209 industrial biotechnology Mathematical optimization 021103 operations research General Computer Science Mathematical model Job shop scheduling Computer science 0211 other engineering and technologies Scheduling (production processes) Processor scheduling 02 engineering and technology Solver Sizing 020901 industrial engineering & automation Electrical and Electronic Engineering Heuristics |
| Zdroj: | IEEE Latin America Transactions. 17:434-443 |
| ISSN: | 1548-0992 |
| DOI: | 10.1109/tla.2019.8863314 |
| Popis: | This paper addresses the two-stage lot sizing and scheduling problem considering the production environment with parallel machines. The aim of this problem is to ensure the synchrony between the stages through of the integrated lot sizing and scheduling decisions. In addition, we consider the presence of a buffer between the production stages with minimum and maximum time lags of the items. Reprocessing, discarding and acceleration costs are considered when the permanence times of the items in the buffer are not respected. Two mathematical models and several heuristics strategies based on decomposition of the problem are presented to solve real data adapted instances. The results showed that our heuristic strategies can achieve competitive solutions in short computational time, outperforming the solutions provided by the optimization solver. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|