A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders
Anselmo Ramalho Pitombeira-Neto, Bruno de Athayde Prata
| Year of publication: |
2020
|
|---|---|
| Authors: | Pitombeira-Neto, Anselmo Ramalho ; Prata, Bruno de Athayde |
| Published in: |
Top : an official journal of the Spanish Society of Statistics and Operations Research. - Berlin : Springer, ISSN 1863-8279, ZDB-ID 2322573-7. - Vol. 28.2020, 1, p. 178-192
|
| Subject: | Cutting and packing problems | Order scheduling problems | Fix-and-optimize | Matheuristics | Scheduling-Verfahren | Scheduling problem | Packproblem | Packing problem | Theorie | Theory | Algorithmus | Algorithm | Operations Research | Operations research | Heuristik | Heuristics |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1007/s11750-019-00531-3 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012236986