Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
From MaRDI portal
Publication:3813294
DOI10.1137/0217053zbMath0662.68043OpenAlexW2085799273MaRDI QIDQ3813294
S. Rao Kosaraju, Mikhail J. Atallah
Publication date: 1988
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/53a1de5a2b0d3b9e1598211dce35d10c26845aca
Analysis of algorithms and problem complexity (68Q25) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Computing methodologies and applications (68U99)
Related Items (37)
Tree based heuristics for the preemptive asymmetric stacker crane problem ⋮ Scheduling electric vehicles and locating charging stations on a path ⋮ Optimal bin location and sequencing in printed circuit board assembly ⋮ Semi-preemptive routing on a linear and circular track ⋮ Serving requests with on-line routing ⋮ Competitive algorithms for the on-line traveling salesman ⋮ Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem ⋮ Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ How to collect balls moving in the Euclidean plane ⋮ A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem ⋮ How to sort by walking and swapping on paths and trees ⋮ Routing a vehicle of capacity greater than one ⋮ A hard dial-a-ride problem that is easy on average ⋮ Pickup and delivery problems with autonomous vehicles on rings ⋮ Pallet location and job scheduling in a twin-robot system ⋮ How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring ⋮ The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail ⋮ Models for the single-vehicle preemptive pickup and delivery problem ⋮ Approximation algorithms for multi-vehicle stacker crane problems ⋮ Unnamed Item ⋮ Crane scheduling in railway yards: an analysis of computational complexity ⋮ Improved bounds for open online dial-a-ride on the line ⋮ Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line ⋮ Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system ⋮ A branch‐and‐cut algorithm for the nonpreemptive swapping problem ⋮ Euler is standing in line dial-a-ride problems with precedence-constraints ⋮ Unnamed Item ⋮ Preemptive stacker crane problem: extending tree-based properties and construction heuristics ⋮ On-line single-server dial-a-ride problems ⋮ Heuristics for the mixed swapping problem ⋮ Semi-preemptive routing on trees ⋮ Approximation algorithms for some min-max and minimum stacker crane cover problems ⋮ Approximation algorithms for some min-max and minimum stacker crane cover problems ⋮ The preemptive swapping problem on a tree ⋮ Dynamic sequencing of robot moves in a manufactoring cell ⋮ Semi–preemptive routing on a line ⋮ Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
This page was built for publication: Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
