On Minimizing Generalized Makespan on Unrelated Machines.
Nikhil AyyadevaraNikhil BansalMilind PrabhuPublished in: APPROX/RANDOM (2023)
Keyphrases
- flowshop
- scheduling problem
- lower bound
- special case
- processing times
- single machine
- optimal solution
- parallel machines
- completion times
- unrelated parallel machines
- minimizing makespan
- permutation flowshop
- identical machines
- batch processing
- bicriteria
- setup times
- convex functions
- machine intelligence
- np hard
- machine learning
- e learning
- artificial intelligence
- genetic algorithm
- scheduling jobs
- data sets
- database