The green capacitated multi-item lot sizing problem with parallel machines
From MaRDI portal
Publication:1651651
DOI10.1016/j.cor.2018.05.024zbMath1391.90035OpenAlexW2807053640WikidataQ129743703 ScholiaQ129743703MaRDI QIDQ1651651
Zhe Liang, Fan Xiao, Canrong Zhang, Yan He, Tao Wu
Publication date: 12 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.05.024
Lagrangian relaxationcolumn generationproduction planningheuristiclot sizingcarbon emissionsenergy consumptionsgreen manufacturing
Integer programming (90C10) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Inventory, storage, reservoirs (90B05) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76)
Related Items
Integrated bin packing and lot-sizing problem considering the configuration-dependent bin packing process, A risk-averse two-stage stochastic programming model for a joint multi-item capacitated line balancing and lot-sizing problem, Dantzig-Wolfe decomposition for the facility location and production planning problem, Towards circular economy in production planning: challenges and opportunities, Cost minimizing planning of container inspection and repair in multiple facilities
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The economic lot-sizing problem with an emission capacity constraint
- The single-item green lot-sizing problem with fixed carbon emissions
- A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders
- Hybrid methods for lot sizing on parallel machines
- Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
- Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions
- Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
- Valid inequalities for mixed 0-1 programs
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- Local branching
- Single-item dynamic lot-sizing problems: an updated survey
- An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
- Including sustainability criteria into inventory models
- The carbon-constrained EOQ
- Lot sizing with carbon emission constraints
- An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
- The feasibility pump
- Dynamic Version of the Economic Lot Size Model
- 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
- The Capacitated Lot-Sizing Problem with Linked Lot Sizes
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
- Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- Deterministic Production Planning: Algorithms and Complexity
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem
- Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines
- Selected Topics in Column Generation
- Production Planning by Mixed Integer Programming
