Maximum lateness minimization in one-dimensional bin packing
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- On cutting stock with due datesOmega, 2014
- A genetic algorithm for two-dimensional bin packing with due datesInternational Journal of Production Economics, 2013
- An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturingEuropean Journal of Operational Research, 2009
- A survey of dual-feasible and superadditive functionsAnnals of Operations Research, 2008
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientationComputers & Operations Research, 2007
- Setup and Open-Stacks Minimization in One-Dimensional Stock CuttingINFORMS Journal on Computing, 2007
- A competitive scheduling problem and its relevance to UMTS channel assignmentNetworks, 2004
- Cutting and Reuse: An Application from Automobile Component ManufacturingOperations Research, 2002
- Scheduling space-sharing for internet advertisingJournal of Scheduling, 2002
- Solving Parallel Machine Scheduling Problems by Column GenerationINFORMS Journal on Computing, 1999