An algorithm for solving the multi-period online fulfillment assignment problem

DOI10.1016/j.mcm.2009.04.024zbMath1185.90138MaRDI QIDQ970031

Stephen Mahar, Kurt M. Bretthauer, Munirpallam A. Venkataramanan

Publication date: 8 May 2010

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2009.04.024

zbMATH Keywords

facility location; supply chain management; multi-period; dual sales channel

Mathematics Subject Classification ID

90B85: Continuous location

90B06: Transportation, logistics and supply chain management

Related Items

An algorithm for solving the multi-period online fulfillment assignment problem, The incremental cooperative design of preventive healthcare networks, A bi-level stochastic optimization model for reliable supply chain in competitive environments: hybridizing exact method and genetic algorithm, Mathematical modeling for a \(p\)-mobile hub location problem in a dynamic environment by a genetic algorithm

Cites Work

• A model for analyzing multi-channel distribution systems
• Service and cost benefits through clicks-and-mortar integration: implications for the centralization/decentralization debate
• An algorithm for solving the multi-period online fulfillment assignment problem
• Integrated inventory pooling for firms servicing both on-line and store demand
• Capacity planning in networks of queues with manufacturing applications
• Models for Supply Chains in E-Business
• An Improved Long-Run Model for Multiple Warehouse Location
• An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
• An algorithm for the capacitated, multi-commodity multi-period facility location problem.
• Unnamed Item