Capacitated lot-sizing and scheduling by Lagrangean relaxation
type: Item
instance of: scholarly article
title: Capacitated lot-sizing and scheduling by Lagrangean relaxation
zbMATH Open document ID: 0761.90060
DOI: 10.1016/0377-2217(92)90201-J
author: Harish C. Bahl
author: Mark H. Karwan
author: Stanley Zionts
author: Moustapha Diaby
published in: European Journal of Operational Research
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 92711
zbMATH Keywords: capacitated lot-sizing and scheduling problem
zbMATH Keywords: production planning
zbMATH Keywords: Lagrangean relaxation
MaRDI profile type: Publication
cites work: Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
cites work: Multi-Item Scheduling by Benders' Decomposition
cites work: On the Generalized Transportation Problem
cites work: Strong Formulations for Multi-Item Capacitated Lot Sizing
cites work: A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
cites work: Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
cites work: Heuristics for Multilevel Lot-Sizing with a Bottleneck
cites work: Hierarchical Production Planning: A Two-Stage System
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: Production Scheduling by the Transportation Method of Linear Programming
cites work: Production and Sales Planning with Limited Shared Tooling at the Key Operation
cites work: Some branch-and-bound procedures for fixed-cost transportation problems
cites work: The Generalized Stepping Stone Method for the Machine Loading Model
cites work: The Economic Lot Scheduling Problem (ELSP): Review and Extensions
cites work: Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
cites work: A Generalized Lagrange Multiplier Algorithm for Optimum or Near Optimum Production Scheduling
cites work: The Factored Transportation Problem
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Deterministic Production Planning with Concave Costs and Capacity Constraints
cites work: Deterministic Production Planning: Algorithms and Complexity
cites work: Using Lagrangean Techniques to Solve Hierarchical Production Planning Problems
cites work: Q4178782
cites work: Multicommodity Distribution System Design by Benders Decomposition
cites work: Relaxation Methods for Pure and Mixed Integer Programming Problems
cites work: Q3285991
cites work: An Efficient Algorithm for Multi-Item Scheduling
cites work: Direct Search Algorithms for Zero-One and Mixed-Integer Programming
cites work: Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources
cites work: Q4739657
cites work: A Transportation Type Aggregate Production Model with Backordering
cites work: Weighted Assignment Models and Their Application
cites work: A Survey of Lagrangean Techniques for Discrete Optimization
cites work: Q4103327
cites work: Multi-item lot size determination and scheduling under capacity constraints
cites work: Dynamic version of the economic lot size model
full work available at URL: 0377-2217(92)90201-j
OpenAlex ID: W2029327492
description: scientific article; zbMATH DE number 92711