Solving the medium newspaper production/distribution problem
From MaRDI portal
Publication:1809799
DOI10.1016/S0377-2217(98)00300-2zbMath0938.90022OpenAlexW2078987982MaRDI QIDQ1809799
David L. Woodruff, Michael G. Van Buer, Rick T. Olson
Publication date: 27 June 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00300-2
Related Items (11)
Supply chain batching problem with identical orders and lifespan ⋮ Tabu search with path relinking for an integrated production-distribution problem ⋮ A variable neighborhood decomposition search method for supply chain management planning problems ⋮ Vehicle routing problems with multiple trips ⋮ A zero-inventory production and distribution problem with a fixed customer sequence ⋮ Vehicle routing problems with multiple trips ⋮ Using genetic algorithm for lot sizing and scheduling problem with arbitrary job volumes and distinct job due date considerations ⋮ Two-echelon location routing synchronized with production schedules and time windows ⋮ Integrated production and distribution scheduling with lifespan constraints ⋮ A heuristic algorithm for the free newspaper delivery problem ⋮ The nuclear medicine production and delivery problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
- Proposals for chunking and tabu search
- Hashing vectors for tabu search
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Convergence of an annealing algorithm
- Cooling Schedules for Optimal Annealing
- Tabu Search—Part I
- Tabu Search—Part II
- Some theoretical implications of local optimization
- Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
- The Reactive Tabu Search
This page was built for publication: Solving the medium newspaper production/distribution problem
