Scheduling for multi-robot routing with blocking and enabling constraints

DOI10.1007/s10951-021-00684-9zbMath1479.90103OpenAlexW3159406747MaRDI QIDQ2059084

Stephen F. Smith, Joris Kinable, Jayanth Krishna Mogali, 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

meta-heuristicsblocking collision constraintsmultirobot schedulingrobotics-assisted manufacturing

Mathematics Subject Classification ID

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

Related Items

A constraint programming model for the scheduling and workspace layout design of a dual-arm multi-tool assembly robot

Cites Work

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