Approximation Algorithms for Drone Delivery Scheduling Problem.
Saswata JanaPartha Sarathi MandalPublished in: CoRR (2022)
Keyphrases
- approximation algorithms
- scheduling problem
- np hard
- precedence constraints
- special case
- flowshop
- worst case
- single machine
- minimum cost
- vertex cover
- strongly np hard
- lower bound
- linear programming
- np hardness
- branch and bound algorithm
- integer programming
- network design problem
- set cover
- facility location problem
- tabu search
- parallel machines
- primal dual
- optimal solution
- job shop scheduling
- approximation ratio
- setup times
- computational complexity
- constant factor
- processing times
- linear program
- sequence dependent setup times
- job shop
- disjoint paths
- approximation schemes
- randomized algorithms
- combinatorial auctions
- feasible solution
- job shop scheduling problem
- release dates
- polynomial time approximation
- knapsack problem
- dynamic programming
- open shop
- closest string
- undirected graph