The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail

DOI10.1007/S11424-015-4197-7zbMath1387.90087OpenAlexW2339805652MaRDI QIDQ1691943

Qiang Gao, Xi-wen Lu

Publication date: 25 January 2018

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-015-4197-7

zbMATH Keywords

schedulingon-line algorithmNP-hardroutingautomated storage and retrieval system

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Application models in control theory (93C95)

Related Items (1)

A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line

Uses Software

• DARCLASS

Cites Work

• Unnamed Item
• Unnamed Item
• Crane scheduling in container yards with inter-crane interference
• A hard dial-a-ride problem that is easy on average
• Design and control of warehouse order picking: a literature review
• A survey of literature on automated storage and retrieval systems
• Research on warehouse design and performance evaluation: a comprehensive review
• Computer-Aided Complexity Classification of Dial-a-Ride Problems
• Nonpreemptive Ensemble Motion Planning on a Tree
• Algorithms for the Assignment and Transportation Problems
• Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
• Scheduling of Container Storage and Retrieval
• Euler is standing in line dial-a-ride problems with precedence-constraints

This page was built for publication: The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail