A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers
From MaRDI portal
Publication:1886858
DOI10.1016/j.cor.2003.08.002zbMath1061.90038OpenAlexW2012547506MaRDI QIDQ1886858
Salleh Yahya, Murali Sambasivan
Publication date: 19 November 2004
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://psasir.upm.edu.my/id/eprint/40149/1/A%20Lagrangean-based%20heuristic%20for%20multi-plant%2C%20multi-item%2C%20multi-period%20capacitated%20lot-sizing%20problems%20with%20inter-plant%20transfers.pdf
Related Items (21)
An effective heuristic for multi-period multi-foodgrain inventory transportation problem in India ⋮ On reformulations for the one-warehouse multi-retailer problem ⋮ On the computational complexity of uncapacitated multi-plant lot-sizing problems ⋮ A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers ⋮ Dynamic capacitated lot-sizing problems: a classification and review of solution approaches ⋮ Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation ⋮ Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items ⋮ Production planning and warehouse management in supply networks with inter-facility mold transfers ⋮ Joint chance constrained shortest path problem with Copula theory ⋮ Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system ⋮ The consistent production routing problem ⋮ The robust multi-plant capacitated lot-sizing problem ⋮ Optimization of the cutting process integrated to the lot sizing in multi-plant paper production industries ⋮ The subcoalition-perfect core of cooperative games ⋮ Modeling industrial lot sizing problems: a review ⋮ MIP formulations and heuristics for two-level production-transportation problems ⋮ A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over ⋮ Matheuristic for the decentralized factories scheduling problem ⋮ Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost ⋮ Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over ⋮ GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
Cites Work
- Unnamed Item
- Unnamed Item
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- A strongly polynomial minimum cost circulation algorithm
- Valid inequalities and separation for capacitated economic lot sizing
- A capacity constrained singlefacility dynamic lot-size model
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
- Simultaneous lotsizing and scheduling on parallel machines
- A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
- Facets and algorithms for capacitated lot sizing
- A cutting plane algorithm for the unrelated parallel machine scheduling problem
- A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers
- The capacitated plant location problem with multiple facilities in the same site
- Dynamic Version of the Economic Lot Size Model
- Uncapacitated lot-sizing: The convex hull of solutions
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Computational Complexity of the Capacitated Lot Size Problem
- Non-identical parallel CNC machine scheduling
This page was built for publication: A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers
