A new multi-objective scheduling problem on batch parallel machines with maximum allowable incompatibility for jobs.
Bahare Shahidi-ZadehFarshid EvazabadianReza Tavakkoli-MoghaddamPublished in: IEEM (2015)
Keyphrases
- parallel machines
- scheduling problem
- multi objective
- unrelated parallel machines
- earliness tardiness
- total tardiness
- flowshop
- sequence dependent setup times
- single machine
- processing times
- precedence constraints
- evolutionary algorithm
- setup times
- minimize total
- total weighted tardiness
- scheduling jobs
- weighted tardiness
- np hard
- release dates
- maximum lateness
- makespan minimization
- parallel machine scheduling problem
- permutation flowshop
- objective function
- particle swarm optimization
- open shop
- identical parallel machines
- genetic algorithm
- tabu search
- minimizing makespan
- list scheduling
- single server
- shared memory
- job shop
- batch processing
- stereo matching
- search algorithm