An Approximate Pareto Set for Minimizing the Maximum Lateness and Makespan on Parallel Machines.
Gais AlhadiImed KacemPierre LarocheIzzeldin M. OsmanPublished in: CoRR (2018)
Keyphrases
- parallel machines
- maximum lateness
- scheduling problem
- release dates
- batch processing machines
- unrelated parallel machines
- flowshop
- scheduling jobs
- sequence dependent setup times
- single machine
- open shop
- precedence constraints
- parallel machine scheduling problem
- completion times
- setup times
- processing times
- single server
- tabu search
- lot sizing
- parallel computing
- np hard
- multi objective
- special case
- multi objective optimization
- job shop scheduling problem
- shared memory
- evolutionary algorithm