Efficient generation of performance bounds for a class of traffic scheduling problems

DOI10.1007/S10626-019-00284-YMaRDI QIDQ2286334zbMATH OpenOpenAlexWikidataFDO

Authors Greyson Daugherty, Greg Mohler, Spyros Reveliotis

Publication date 22 January 2020

Published in Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10626-019-00284-y

zbMATH Keywords

combinatorial optimizationguidepath-based traffic systemsLagrangian dualitytraffic scheduling

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Deterministic scheduling theory in operations research (90B35) Linear programming (90C05) Mixed integer programming (90C11) Combinatorial optimization (90C27)

Recommendations

• Performance bounds for queueing networks and scheduling policies
• Généralisation Max-Plus des bornes de Lageweg, Lenstra et Rinnooy Kan
• Performance bounds for queues via generating functions
• Optimization of multiclass queueing networks with changeover times via the achievable region approach. II: The multi-station case
• New linear program performance bounds for queueing networks

Cites work

• A linear-time algorithm for the feasibility of pebble motion on trees
• Conflict-based search for optimal multi-agent pathfinding
• Developing Conflict-Free Routes for Automated Guided Vehicles
• Graph puzzles, homotopy, and the alternating group
• scientific article; zbMATH DE number 5959974 (Why is no real title available?)
• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• Introduction to Discrete Event Systems
• Linear and nonlinear programming
• Model predictive control. Classical, robust and stochastic
• Network flows. Theory, algorithms, and applications.
• On the Complexity of Maximally Permissive Deadlock Avoidance in Multi-Vehicle Traffic Systems
• Quantum computation and quantum information. 10th anniversary edition
• Subdimensional expansion for multirobot path planning
• The Lagrangian Relaxation Method for Solving Integer Programming Problems

Describes a project that uses

Uses Software

• UMDES

This page was built for publication: Efficient generation of performance bounds for a class of traffic scheduling problems

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