Approximation algorithms for the twin robot scheduling problem

DOI10.1007/S10951-019-00631-9zbMath1434.90061OpenAlexW2999133996WikidataQ126403519 ScholiaQ126403519MaRDI QIDQ2305018

Florian Jaehn, Andreas Wiehl

Publication date: 10 March 2020

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-019-00631-9

zbMATH Keywords

approximation algorithmscrane schedulingautomated storage and retrieval systemsnon-crossing constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Pallet location and job scheduling in a twin-robot system

Cites Work

• Unnamed Item
• Cooperative twin-crane scheduling
• A survey of literature on automated storage and retrieval systems
• A generalized classification scheme for crane scheduling with interference
• Scheduling cooperative gantry cranes with seaside and landside jobs
• An exact solution approach for scheduling cooperative gantry cranes
• An Optimal Routing Algorithm for a Transfer Crane in Port Container Terminals
• Scheduling twin robots on a line
• A decomposition heuristic for the twin robots scheduling problem
• The blocking job shop with rail-bound transportation

This page was built for publication: Approximation algorithms for the twin robot scheduling problem