Progressive selection method for the coupled lot-sizing and cutting-stock problem

DOI10.1287/IJOC.2017.0746zbMATH Open1386.90084OpenAlexW2579916312MaRDI QIDQ4599321FDOQ4599321

Kerem Akartunalı, Zhe Liang, Tao Wu, Raf Jans

Publication date: 29 December 2017

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://strathprints.strath.ac.uk/59066/

Recommendations

• Decomposition methods for the lot-sizing and cutting-stock problems in paper industries
• Solving a combined cutting-stock and lot-sizing problem with a column generating procedure
• An analysis of the integrated lot-sizing and cutting-stock problem formulation
• Cutting Stock Problems
• A residual recombination heuristic for one-dimensional cutting stock problems

zbMATH Keywords

heuristicsinteger programmingcolumn generationlot sizingcutting stockDantzig-Wolfe decomposition

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Production models (90B30)

Cites Work

• A Linear Programming Approach to the Cutting-Stock Problem
• Selected Topics in Column Generation
• Production Planning by Mixed Integer Programming
• Stabilized column generation
• Title not available (Why is that?)
• Production planning in furniture settings via robust optimization
• Risk-averse two-stage stochastic programs in furniture plants
• Solving a combined cutting-stock and lot-sizing problem with a column generating procedure
• Pattern reduction in one-dimensional cutting stock problems
• Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• A linear optimization approach to the combined production planning model
• Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application
• The combined cutting stock and lot-sizing problem in industrial processes
• A coupling cutting stock-lot sizing problem in the paper industry
• Handbook of metaheuristics
• Column Generation
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Cutting Stock Problems
• A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
• A survey of dual-feasible and superadditive functions
• Random search in the one-dimensional cutting stock problem
• Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
• Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results
• A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
• An LP-based approach to a two-stage cutting stock problem
• An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
• Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
• On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times
• A heuristic approach for big bucket multi-level production planning problems
• Improved lower bounds for the capacitated lot sizing problem with setup times.
• A Cutting Stock and Scheduling Problem in the Copper Industry
• A computational analysis of lower bounds for big bucket production planning problems
• A dynamic stochastic stock-cutting problem
• A combined cutting-stock and lot-sizing problem
• Cutting and Reuse: An Application from Automobile Component Manufacturing
• Selection and Design of Heuristic Procedures for Solving Roll Trim Problems
• A horizon decomposition approach for the capacitated lot-sizing problem with setup times
• Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems

Cited In (12)

• Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines
• Classification and literature review of integrated lot-sizing and cutting stock problems
• Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine
• A supervised learning-driven heuristic for solving the facility location and production planning problem
• Heuristic algorithms based on column generation for an online product shipping problem
• Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution
• The green capacitated multi-item lot sizing problem with parallel machines
• Dantzig-Wolfe decomposition for the facility location and production planning problem
• Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover
• Integrated bin packing and lot-sizing problem considering the configuration-dependent bin packing process
• Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
• The integrated lot sizing and cutting stock problem in an automotive spring factory

This page was built for publication: Progressive selection method for the coupled lot-sizing and cutting-stock problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4599321)