A computational analysis of lower bounds for big bucket production planning problems
type: Item
instance of: scholarly article
title: A computational analysis of lower bounds for big bucket production planning problems
zbMATH Open document ID: 1264.90125
author: Kerem Akartunalı
author: Andrew J. Miller
published in: Computational Optimization and Applications
publication date: 2013-02-18T00:00:00Z
full work available at URL: https://strathprints.strath.ac.uk/39630/
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 6137006
zbMATH Keywords: production planning
zbMATH Keywords: lot-sizing
zbMATH Keywords: integer programming
zbMATH Keywords: strong formulations
zbMATH Keywords: Lagrangian relaxation
describes a project that uses: bc-prod
describes a project that uses: MULTILSB
MaRDI profile type: Publication
OpenAlex ID: W2018062997
cites work: A heuristic approach for big bucket multi-level production planning problems
cites work: Multi-item lot-sizing with joint set-up costs
cites work: A study of the lot-sizing polytope
cites work: Strong Formulations for Multi-Item Capacitated Lot Sizing
cites work: Uncapacitated lot-sizing: The convex hull of solutions
cites work: bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
cites work: Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
cites work: Heuristics for Multilevel Lot-Sizing with a Bottleneck
cites work: The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
cites work: Computational Complexity of the Capacitated Lot Size Problem
cites work: Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
cites work: A cutting plane approach to capacitated lot-sizing with start-up costs
cites work: A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
cites work: Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
cites work: A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
cites work: Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
cites work: Deterministic Production Planning with Concave Costs and Capacity Constraints
cites work: Deterministic Production Planning: Algorithms and Complexity
cites work: Mixing mixed-integer inequalities
cites work: Improved lower bounds for the capacitated lot sizing problem with setup times.
cites work: Lot sizing in general assembly systems with setup costs, setup times, and multiple constrained resources
cites work: Q4139966
cites work: Uncapacitated lot sizing with backlogging: the convex hull
cites work: Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities
cites work: The uncapacitated lot-sizing problem with sales and safety stocks
cites work: The 0-1 knapsack problem with a single continuous variable
cites work: Aggregation and Mixed Integer Rounding to Solve MIPs
cites work: On the polyhedral structure of a multi-item production planning model with setup times
cites work: Lot-size models with backlogging: Strong reformulations and cutting planes
cites work: Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
cites work: Polyhedra for lot-sizing with Wagner-Whitin costs
cites work: Production Planning by Mixed Integer Programming
cites work: Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
cites work: Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
cites work: Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
cites work: Modeling multiple stage manufacturing systems with generalized costs and capacity issues
cites work: Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
cites work: A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
cites work: A general heuristic for production planning problems
cites work: Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation
cites work: A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
DOI: 10.1007/S10589-012-9465-Z
description: scientific article; zbMATH DE number 6137006