Approximation algorithms for scheduling C-benevolent jobs on weighted machines.
Ge YuSheldon H. JacobsonPublished in: IISE Trans. (2020)
Keyphrases
- approximation algorithms
- identical parallel machines
- identical machines
- strongly np hard
- precedence constraints
- polynomial time approximation
- scheduling problem
- np hard
- flowshop
- parallel machines
- processing times
- open shop
- special case
- release dates
- worst case
- completion times
- job scheduling
- facility location problem
- vertex cover
- parallel processors
- sequence dependent setup times
- single machine
- minimum cost
- randomized algorithms
- set cover
- setup times
- primal dual
- constant factor
- wafer fabrication
- approximation ratio
- maximum lateness
- approximation schemes
- single server
- single machine scheduling problem
- scheduling decisions
- undirected graph
- disjoint paths
- constant factor approximation
- shortest processing time
- competitive ratio
- optimal solution
- release times
- combinatorial auctions
- tabu search