Distance matrix based heuristics to minimize makespan of parallel batch processing machines with arbitrary job sizes and release times.
Shengchao ZhouHuaping ChenXueping LiPublished in: Appl. Soft Comput. (2017)
Keyphrases
- batch processing machines
- maximum lateness
- single machine
- release times
- distance matrix
- scheduling problem
- release dates
- processing times
- sequence dependent setup times
- single machine scheduling problem
- dynamic programming
- multidimensional scaling
- search algorithm
- triangle inequality
- tabu search
- simulated annealing
- precedence constraints