Minimizing the total completion time on a parallel machine system with tool changes.
Antonio CostaFulvio Antonio CappadonnaSergio FicheraPublished in: Comput. Ind. Eng. (2016)
Keyphrases
- parallel machines
- scheduling problem
- earliness tardiness
- unrelated parallel machines
- total tardiness
- sequence dependent setup times
- precedence constraints
- massively parallel
- list scheduling
- information systems
- scheduling jobs
- shared memory
- lot sizing
- parallel computing
- completion times
- release dates
- stereo matching
- parallel algorithm
- np hard
- minimizing makespan
- special case
- bayesian networks
- decision making