Modification of Haessler’s sequential heuristic procedure for the one-dimensional cutting stock problem with setup cost
Fuente:
Redalyc
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artículo científico |
| Sprache: | en |
| Veröffentlicht: |
Associação Brasileira de Engenharia de Produção
2018
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1876459378337382400 |
|---|---|
| author | Mateus Martin |
| author_facet | Mateus Martin |
| contents | Modification of Haessler’s sequential heuristic procedure for the one-dimensional cutting stock problem with setup cost Mateus Martin Antonio Moretti Marcia Gomes-Ruggiero Luiz Salles Neto Ingeniería Problem Heuristics Setup costs Cutting stock Paper aims We propose a modified Sequential Heuristic Procedure (MSHP) to reduce the cutting waste and number of setups for the One-Dimensional Cutting Stock Problem with Setup Cost. Originality This heuristic modifies Haessler’s sequential heuristic procedure (1975) by adapting the Integer Bounded Knapsack Problem to generate cutting patterns, instead of the original lexicographic search employed. The solution strategy is to generate different cutting plans using MSHP, and then to use an integer programming model to seek even better results. Research method It is a axiomatic research, ordinary in studies of Operational Research.Main findings In the computational experiments, we demonstrate the effectiveness of the algorithm with two sets of benchmark instances by comparing it with other approaches, and obtaining better solutions for some scenarios. Implications for theory and practice The approach is suitable for practitioners from different industrial settings due to its easily coding and possible adaptation for problem extensions. 2018 artículo científico 0103-6513 https://www.redalyc.org/articulo.oa?id=396754754026 10.1590/0103-6513.20170105 en http://www.redalyc.org/revista.oa?id=3967 Production application/pdf Associação Brasileira de Engenharia de Produção Production (Brasil) Vol.28 |
| format | Artículo científico |
| id | redalyc_396754754026 |
| institution | Redalyc |
| language | en |
| publishDate | 2018 |
| publisher | Associação Brasileira de Engenharia de Produção |
| spellingShingle | Modification of Haessler’s sequential heuristic procedure for the one-dimensional cutting stock problem with setup cost Mateus Martin Ingeniería Problem Heuristics Setup costs Cutting stock Modification of Haessler’s sequential heuristic procedure for the one-dimensional cutting stock problem with setup cost Mateus Martin Antonio Moretti Marcia Gomes-Ruggiero Luiz Salles Neto Ingeniería Problem Heuristics Setup costs Cutting stock Paper aims We propose a modified Sequential Heuristic Procedure (MSHP) to reduce the cutting waste and number of setups for the One-Dimensional Cutting Stock Problem with Setup Cost. Originality This heuristic modifies Haessler’s sequential heuristic procedure (1975) by adapting the Integer Bounded Knapsack Problem to generate cutting patterns, instead of the original lexicographic search employed. The solution strategy is to generate different cutting plans using MSHP, and then to use an integer programming model to seek even better results. Research method It is a axiomatic research, ordinary in studies of Operational Research.Main findings In the computational experiments, we demonstrate the effectiveness of the algorithm with two sets of benchmark instances by comparing it with other approaches, and obtaining better solutions for some scenarios. Implications for theory and practice The approach is suitable for practitioners from different industrial settings due to its easily coding and possible adaptation for problem extensions. 2018 artículo científico 0103-6513 https://www.redalyc.org/articulo.oa?id=396754754026 10.1590/0103-6513.20170105 en http://www.redalyc.org/revista.oa?id=3967 Production application/pdf Associação Brasileira de Engenharia de Produção Production (Brasil) Vol.28 |
| title | Modification of Haessler’s sequential heuristic procedure for the one-dimensional cutting stock problem with setup cost |
| topic | Ingeniería Problem Heuristics Setup costs Cutting stock |
| url | https://www.redalyc.org/articulo.oa?id=396754754026 |