A robust strategy approach to a strategic mobility problem

DOI10.1016/0377-2217(94)90357-3zbMath0815.90112MaRDI QIDQ1342065

Reha Uzsoy, Gündüz Ulusoy

Publication date: 11 January 1995

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90357-3

zbMATH Keywords

heuristic procedures; robust strategy; bottleneck routing; strategic airlift problem; strategic mobility problem

Mathematics Subject Classification ID

90B90: Case-oriented studies in operations research

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling batches on parallel machines with major and minor set-ups
• The vehicle routing problem: An overview of exact and approximate algorithms
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• Balancing Workloads and Minimizing Set-up Costs in the Parallel Processing Shop
• Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
• An Application of Bin-Packing to Multiprocessor Scheduling
• Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search
• Bounds on Multiprocessing Timing Anomalies
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Some Heuristics for Scheduling Jobs on Parallel Machines with Setups