Bin Packing Problems with Variable Pattern Processing Times: A Proof-of-concept
- 5 November 2017
- book chapter
- Published by Springer Nature in Springer Proceedings in Mathematics & Statistics
- p. 453-460
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Maximum lateness minimization in one-dimensional bin packingOmega, 2017
- Bin packing and cutting stock problems: Mathematical models and exact algorithmsEuropean Journal of Operational Research, 2016
- On cutting stock with due datesOmega, 2014
- A genetic algorithm for two-dimensional bin packing with due datesInternational Journal of Production Economics, 2013
- Reducing the number of cuts in generating three-staged cutting patternsEuropean Journal of Operational Research, 2012
- On LP relaxations for the pattern minimization problemNetworks, 2010
- The one-dimensional cutting stock problem with due datesEuropean Journal of Operational Research, 2010
- Packing problems and project scheduling models: an integrating perspectiveJournal of the Operational Research Society, 2000
- Lower bounds and reduction procedures for the bin packing problemDiscrete Applied Mathematics, 1990
- Mathematical Methods of Organizing and Planning ProductionManagement Science, 1960