A knapsack problem as a tool to solve the production planning problem in small foundries
From MaRDI portal
Publication:1761949
DOI10.1016/j.cor.2010.10.023zbMath1251.90027OpenAlexW2011272491MaRDI QIDQ1761949
Victor C. B. Camargo, Leandro Mattiolli, Franklina Maria Bragion Toledo
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.10.023
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05)
Related Items
An integrated fuzzy TOPSIS-knapsack problem model for order selection in a bakery ⋮ Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines ⋮ Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items ⋮ A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm ⋮ Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problem ⋮ The production planning problem of orders in small foundries
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Pre-disaster investment decisions for strengthening a highway network
- Lot sizing and scheduling -- survey and extensions
- A lot-sizing problem in an automated foundry
- Lot sizing and furnace scheduling in small foundries
- Single item lot sizing problems
- Discretized formulations for capacitated location problems with modular distribution costs
- An approach for solving the lot-sizing problem of a market-driven foundry
- Modeling industrial lot sizing problems: a review
- Evolutionary Computation in Combinatorial Optimization
- Evolutionary Multi-Criterion Optimization
