Tabu search for scheduling on identical parallel machines to minimize mean tardiness.
Vinícius Amaral ArmentanoDenise Sato YamashitaPublished in: J. Intell. Manuf. (2000)
Keyphrases
- tabu search
- scheduling problem
- identical parallel machines
- scheduling jobs
- single machine
- processing times
- minimize total
- tardiness cost
- completion times
- release dates
- parallel machines
- feasible solution
- flowshop
- search procedure
- np hard
- memetic algorithm
- job shop scheduling problem
- precedence constraints
- setup times
- sequence dependent setup times
- job shop
- vehicle routing problem
- hybrid algorithm
- single machine scheduling problem
- strongly np hard
- metaheuristic
- competitive ratio
- fixed number
- lower bound
- solution quality
- decision problems
- cost function