A rescheduling and cost allocation mechanism for delayed arrivals

DOI10.1016/J.COR.2015.07.016zbMATH Open1349.90392OpenAlexW1408989351MaRDI QIDQ342157FDOQ342157

Authors: Edward C. Rosenthal, Eric M. Eisenstein 

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2015.07.016

Recommendations

• Incentives in landing slot problems
• Efficient (re-)scheduling: an auction approach
• Scheduling aircraft landings using airlines' preferences
• An incentive compatible, efficient market for air traffic flow management
• An incentive compatible, efficient market for air traffic flow management

zbMATH Keywords

assignment problemproduction schedulingcombinatorial exchangeVickrey-Clarke-groves mechanism

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Discrete location and assignment (90B80)

Cites Work

• Title not available (Why is that?)
• Sequencing games
• Cores of convex games
• The assignment game. I: The core
• Flight operations recovery: New approaches considering passenger recovery
• Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
• Incentives in Teams
• Strategyproof sharing of submodular costs: budget balance versus efficiency
• Worst-case optimal redistribution of VCG payments in multi-unit auctions
• Achieving the first best in sequencing problems.
• Thirteen Reasons Why the Vickrey-Clarke-Groves Process Is Not Practical
• On the Airline Schedule Perturbation Problem Caused by the Ground Delay Program
• Scheduling aircraft landings -- the static case
• Heuristic and exact algorithms for scheduling aircraft landings
• Algorithms for scheduling runway operations under constrained position shifting
• Optimization and mediated bartering models for ground delay programs
• Relaxed sequencing games have a nonempty core
• Priority auctions and queue disciplines that depend on processing time
• Displacement problem and dynamically scheduling aircraft landings
• On the waiting time of arriving aircrafts and the capacity of airports with one or two runways
• Stable priority purchasing in queues
• How airlines and airports recover from schedule perturbations: A survey
• Some effects of aircraft arrival sequence algorithms
• ICE: an expressive iterative combinatorial exchange
• Decentralized Regulation of a Queue
• Title not available (Why is that?)
• Optimum Bribing for Queue Position
• Title not available (Why is that?)
• Purchasing Priorities in Queues
• Simple sequencing problems with interdependent costs

Cited In (2)

• Incentives in landing slot problems
• A data-driven flight schedule optimization model considering the uncertainty of operational displacement

This page was built for publication: A rescheduling and cost allocation mechanism for delayed arrivals

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