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