An exact solution approach for an integrated packing and scheduling problem
Cutting stock and bin-packing problems are both well known to be NP-hard problems. An interesting variant of these standard problems is the one that consider due dates. The time periods and the need to determine an order by which the orders should be cut increase the practical complexity of these pr...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | conferencePaper |
| Idioma: | eng |
| Publicado em: |
2013
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/26673 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/26673 |