Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines.
Gais AlhadiImed KacemPierre LarocheIzzeldin M. OsmanPublished in: Ann. Oper. Res. (2020)
Keyphrases
- maximum lateness
- parallel machines
- approximation algorithms
- scheduling problem
- open shop
- np hard
- release dates
- batch processing machines
- flowshop
- unrelated parallel machines
- precedence constraints
- special case
- sequence dependent setup times
- single machine
- scheduling jobs
- completion times
- strongly np hard
- setup times
- processing times
- parallel machine scheduling problem
- worst case
- job shop
- tabu search
- lower bound
- lot sizing
- single machine scheduling problem
- optimal solution
- single server
- integer programming
- knapsack problem
- constraint satisfaction problems
- parallel computing
- combinatorial auctions
- linear programming
- probabilistic model
- computational complexity