The green capacitated multi-item lot sizing problem with parallel machines
type: Item
instance of: scholarly article
title: The green capacitated multi-item lot sizing problem with parallel machines
zbMATH Open document ID: 1391.90035
author: Fan Xiao
author: Canrong Zhang
author: Yan He
author: Zhe Liang
author: Tao Wu
published in: Computers \& Operations Research
publication date: 2018-07-12T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 91B76
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 6902866
zbMATH Keywords: green manufacturing
zbMATH Keywords: energy consumptions
zbMATH Keywords: carbon emissions
zbMATH Keywords: lot sizing
zbMATH Keywords: production planning
zbMATH Keywords: heuristic
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: column generation
describes a project that uses: FEASPUMP
MaRDI profile type: Publication
full work available at URL: j.cor.2018.05.024
OpenAlex ID: W2807053640
cites work: Lot sizing with carbon emission constraints
cites work: The single-item green lot-sizing problem with fixed carbon emissions
cites work: Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
cites work: Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
cites work: bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
cites work: Including sustainability criteria into inventory models
cites work: Single-item dynamic lot-sizing problems: an updated survey
cites work: Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
cites work: The carbon-constrained EOQ
cites work: A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
cites work: Q4475624
cites work: Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
cites work: Hybrid methods for lot sizing on parallel machines
cites work: The feasibility pump
cites work: Local branching
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Deterministic Production Planning: Algorithms and Complexity
cites work: A horizon decomposition approach for the capacitated lot-sizing problem with setup times
cites work: Q4178782
cites work: The economic lot-sizing problem with an emission capacity constraint
cites work: Improved lower bounds for the capacitated lot sizing problem with setup times.
cites work: Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions
cites work: Selected Topics in Column Generation
cites work: Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
cites work: Production Planning by Mixed Integer Programming
cites work: Valid inequalities for mixed 0-1 programs
cites work: Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems
cites work: Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
cites work: The Capacitated Lot-Sizing Problem with Linked Lot Sizes
cites work: A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
cites work: A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
cites work: A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
cites work: Dynamic version of the economic lot size model
cites work: Q4254875
cites work: Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem
cites work: Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines
cites work: An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
cites work: An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
cites work: A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders
Wikidata QID: Q129743703
DOI: 10.1016/J.COR.2018.05.024
description: scientific article; zbMATH DE number 6902866