A heuristic approach for big bucket multi-level production planning problems
type: Item
instance of: scholarly article
title: A heuristic approach for big bucket multi-level production planning problems
zbMATH Open document ID: 1160.90358
author: Kerem Akartunalı
author: Andrew J. Miller
published in: European Journal of Operational Research
publication date: 2008-12-02T00:00:00Z
full work available at URL: https://strathprints.strath.ac.uk/18806/
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 5376954
zbMATH Keywords: integer programming
zbMATH Keywords: production planning
zbMATH Keywords: heuristics
zbMATH Keywords: relax-and-fix
zbMATH Keywords: strong formulations
describes a project that uses: MULTILSB
describes a project that uses: FEASPUMP
describes a project that uses: XPRESS
describes a project that uses: Mosel
describes a project that uses: bc-prod
describes a project that uses: Octane
MaRDI profile type: Publication
OpenAlex ID: W2026582326
cites work: Optimal Lot-Sizing Algorithms for Complex Product Structures
cites work: Improved Algorithms for Economic Lot Size Problems
cites work: A study of the lot-sizing polytope
cites work: Octane: A New Heuristic for Pure 0–1 Programs
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: A cutting plane approach to capacitated lot-sizing with start-up costs
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
cites work: Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
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: The feasibility pump
cites work: Local branching
cites work: Deterministic Production Planning with Concave Costs and Capacity Constraints
cites work: Deterministic Production Planning: Algorithms and Complexity
cites work: Lot sizing in general assembly systems with setup costs, setup times, and multiple constrained resources
cites work: Q4139966
cites work: The uncapacitated lot-sizing problem with sales and safety stocks
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: 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: An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
cites work: A general heuristic for production planning problems
cites work: Approximate extended formulations
cites work: Dynamic version of the economic lot size model
cites work: Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation
DOI: 10.1016/J.EJOR.2007.11.033
description: scientific article; zbMATH DE number 5376954