Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
type: Item
instance of: scholarly article
title: Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
zbMATH Open document ID: 1303.90072
author: Diego Jacinto Fiorotto
author: Silvio Alexandre de Araujo
published in: Annals of Operations Research
publication date: 2015-01-22T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 6389137
zbMATH Keywords: lot sizing
zbMATH Keywords: parallel machines
zbMATH Keywords: reformulations
zbMATH Keywords: Lagrangian heuristic
describes a project that uses: XPRESS
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: s10479-014-1570-1
OpenAlex ID: W2000176534
cites work: LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm
cites work: bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
cites work: Q4133397
cites work: Economic Lot Scheduling for Multiple Products on Parallel Identical Processors
cites work: Analysis of relaxations for the multi-item capacitated lot-sizing problem
cites work: A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
cites work: Dynamic Production Scheduling for a Process Industry
cites work: On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times
cites work: Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times
cites work: Capacitated lot-sizing and scheduling by Lagrangean relaxation
cites work: Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
cites work: Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints
cites work: Improved lower bounds for the capacitated lot sizing problem with setup times.
cites work: Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs
cites work: Q4139966
cites work: An Efficient Algorithm for Multi-Item Scheduling
cites work: Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company
cites work: Simultaneous lotsizing and scheduling on parallel machines
cites work: Q4040221
cites work: Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions
cites work: Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
cites work: A general heuristic for production planning problems
cites work: Some Extensions of the Discrete Lotsizing and Scheduling Problem
cites work: Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
cites work: A single-product parallel-facilities production-planning model
cites work: Lagrangean relaxation based heuristics for lot sizing with setup times
cites work: A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures
cites work: A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
DOI: 10.1007/S10479-014-1570-1
description: scientific article; zbMATH DE number 6389137