Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A decomposition heuristic for the twin robots scheduling problem

From MaRDI portal
Publication:4632878
Jump to:navigation, search

DOI10.1002/nav.21610zbMath1411.90137OpenAlexW1522656665MaRDI QIDQ4632878

Simon Emde, Nils Boysen, Dirk Briskorn

Publication date: 2 May 2019

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.21610


zbMATH Keywords

dynamic programmingnoncrossing constraintstwin robots scheduling


Mathematics Subject Classification ID

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


Related Items (7)

Twin-crane scheduling during seaside workload peaks with a dedicated handshake area ⋮ Cooperative twin-crane scheduling ⋮ Pallet location and job scheduling in a twin-robot system ⋮ A generalized classification scheme for crane scheduling with interference ⋮ Scheduling cooperative gantry cranes with seaside and landside jobs ⋮ Approximation algorithms for the twin robot scheduling problem ⋮ Routing two stacking cranes with predetermined container sequences




This page was built for publication: A decomposition heuristic for the twin robots scheduling problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4632878&oldid=18811351"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 February 2024, at 15:15.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki