An integer programming approach for the 2-schemes strip cutting problem with a sequencing constraint

We study integer programming formulations for the 2-schemes strip cutting problem with a sequencing constraint (2-SSCPsc) considered by Rinaldi and Franz. The 2-SSCPsc arises in the context of corrugated cardboard production, which involves cutting strips of large lengths into rectangles of at most...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Lucero, S., Marenco, J., Martínez, F.
Formato: JOUR
Materias:
Corrugated cardboard
Integer programming
Sequencing
Heuristic methods
Computational experiment
Corrugated cardboards
Cutting problems
Cutting strips
Heuristic procedures
Integer programming formulations
Integrality gaps
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_13894420_v16_n3_p605_Lucero
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares