Scheduling for multi-robot routing with blocking and enabling constraints

DOI10.1007/S10951-021-00684-9MaRDI QIDQ2059084zbMATH OpenOpenAlexFDO

Authors Jayanth Krishna Mogali, J. Kinable, Stephen F. Smith, Zachary B. Rubinstein

Publication date 13 December 2021

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

Full work available at URL https://doi.org/10.1007/s10951-021-00684-9

zbMATH Keywords

blocking collision constraintsmeta-heuristicsmultirobot schedulingrobotics-assisted manufacturing

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Spatio-temporal multi-robot routing
• Multi-robot systems scheduling under certainty constraints
• Scheduling twin robots on a line
• A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots
• Route Planning for Robot Systems

Cites work

• A branch and bound algorithm for scheduling trains in a railway network
• A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
• A crane scheduling method for port container terminals
• A neighborhood for complex job shop scheduling problems with regular objectives
• A new neighborhood and tabu search for the blocking job shop
• A survey of berth allocation and quay crane scheduling problems in container terminals
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• A tabu search heuristic for the quay crane scheduling problem
• An Alternative Family of Transformations
• Approaches to modeling train scheduling problems as job-shop problems with blocking constraints
• Conflict-based search for optimal multi-agent pathfinding
• Efficient primal heuristic updates for the blocking job shop problem
• Enhancing stochastic search performance by value-biased randomization of heuristics
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Implementation of a linear time algorithm for certain generalized traveling salesman problems
• Job shop scheduling with setup times, deadlines and precedence constraints
• Job-shop scheduling with blocking and no-wait constraints
• New classes of efficiently solvable generalized traveling salesman problems
• Scheduling of dual-arm multi-tool assembly robots and workspace layout optimization
• Scheduling with AND/OR Precedence Constraints
• Template matching and decision diagrams for multi-agent path finding
• The late acceptance hill-climbing heuristic
• Two-Processor Scheduling with Start-Times and Deadlines

Cited in

(4)

• Multi-robot systems scheduling under certainty constraints
• A constraint programming model for the scheduling and workspace layout design of a dual-arm multi-tool assembly robot
• A unified solution framework for flexible job shop scheduling problems with multiple resource constraints
• Spatio-temporal multi-robot routing

This page was built for publication: Scheduling for multi-robot routing with blocking and enabling constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2059084)