Cross-facility management of production and transportation planning problem

DOI10.1016/j.cor.2005.02.038zbMath1113.90052MaRDI QIDQ2499157

Panos M. Pardalos, H. Edwin Romeijn, Sandra Duni Ekşioğlu

Publication date: 14 August 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.02.038

zbMATH Keywords

heuristic approach; supply chains; production planning problem; fixed-charge network flow problem; transportation planning problem

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

90C59: Approximation methods and heuristics in mathematical programming

90B30: Production models

90B10: Deterministic network models in operations research

Related Items

A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge, A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment, Mathematical programming models for supply chain production and transport planning, Optimization of production allocation and transportation of customer orders for a leading forest products company, Mathematical programming model for centralised master planning in ceramic tile supply chains, A LAGRANGIAN-BASED SOLUTION ALGORITHM FOR STRATEGIC SUPPLY CHAIN DISTRIBUTION DESIGN IN UNCERTAIN ENVIRONMENT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new dynamic programming algorithm for the single item capacitated dynamic lot size model
• Coordination of production and distribution planning
• Integrated production/distribution planning in supply chains: An invited review
• Dynamic Version of the Economic Lot Size Model
• A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
• Analysis of a flow problem with fixed charges
• A Dual-Based Procedure for Uncapacitated Facility Location
• An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
• Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
• The complexity of the network design problem
• Manufacturing Planning Over Alternative Facilities: Modeling, Analysis and Algorithms
• Minimum Concave Cost Flows in Certain Networks
• A probabilistic analysis of the multi-period single-sourcing problem