A polynomial-time approximation scheme for the airplane refueling problem

DOI10.1007/S10951-018-0569-XzbMath1425.90043arXiv1512.06353OpenAlexW2962812365WikidataQ129813230 ScholiaQ129813230MaRDI QIDQ2327962

Iftah Gamzu, Danny Segev

Publication date: 8 October 2019

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

Full work available at URL: https://arxiv.org/abs/1512.06353

zbMATH Keywords

schedulingapproximation algorithmsPTASgeneralized assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (2)

A novel MILP model for \(N\)-vehicle exploration problem ⋮ Approximation Algorithms for Generalized Path Scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient approximation for the generalized assignment problem
• An approximation algorithm for the generalized assignment problem
• Non-preemptive buffer management for latency sensitive packets
• A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
• Tight Approximation Algorithms for Maximum Separable Assignment Problems
• Sum and Product in Dynamic Epistemic Logic
• The Pure Theory of Elevators
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• A New Approach to Online Scheduling
• Improved bounds for scheduling conflicting jobs with minsum criteria
• How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions
• The Geometry of Scheduling
• Dual Techniques for Scheduling on a Machine with Varying Speed
• A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems
• Polynomial time approximation schemes for the traveling repairman and other minimum latency problems.
• Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
• The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders

This page was built for publication: A polynomial-time approximation scheme for the airplane refueling problem