A tabu search heuristic for redesigning a multi-echelon supply chain network over a planning horizon
- 31 March 2012
- journal article
- Published by Elsevier BV in International Journal of Production Economics
- Vol. 136 (1), 218-230
- https://doi.org/10.1016/j.ijpe.2011.11.022
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Lower and upper bounds for a capacitated plant location problem with multicommodity flowComputers & Operations Research, 2009
- A heuristic approach to logistics network design for end-of-lease computer products recoveryTransportation Research. Part E, Logistics and Transportation Review, 2008
- Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in AndalusiaEuropean Journal of Operational Research, 2007
- Bounds for the single source modular capacitated plant location problemComputers & Operations Research, 2006
- Design of international assembly systems and their supply chains under NAFTATransportation Research. Part E, Logistics and Transportation Review, 2005
- Global supply chain design: A literature review and critiqueTransportation Research. Part E, Logistics and Transportation Review, 2005
- A compact model and tight bounds for a combined location-routing problemComputers & Operations Research, 2005
- Upper and lower bounds for the single source capacitated location problemEuropean Journal of Operational Research, 2003
- Modeling and design of global logistics systems: A review of integrated strategic and tactical models and design algorithmsEuropean Journal of Operational Research, 2002
- HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTSDecision Sciences, 1977