Makespan Minimization on Unrelated Parallel Machines with a Few Bags.
Daniel R. PageRoberto Solis-ObaPublished in: AAIM (2018)
Keyphrases
- unrelated parallel machines
- parallel machines
- scheduling problem
- flowshop
- setup times
- processing times
- sequence dependent setup times
- precedence constraints
- job shop scheduling problem
- single machine
- parallel computing
- polynomially solvable
- release dates
- shared memory
- single server
- job shop scheduling
- lot sizing
- objective function
- tabu search
- np hard
- special case