Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times.
Hanane KrimNicolas ZuffereyJean-Yves PotvinRachid BenmansourDavid DuvivierPublished in: J. Sched. (2022)
Keyphrases
- scheduling problem
- sum of completion times
- tabu search
- parallel machine scheduling problem
- single machine
- flowshop
- feasible solution
- release dates
- memetic algorithm
- path relinking
- sequence dependent setup times
- processing times
- setup times
- np hard
- hybrid algorithm
- maximum lateness
- precedence constraints
- completion times
- job shop scheduling problem
- parallel machines
- benchmark instances
- search procedure
- job shop scheduling
- job shop
- vehicle routing problem
- heuristic methods
- neural network
- scatter search
- variable neighborhood search
- particle swarm optimization pso