An Efficient Best Response Heuristic for a Non-preemptive Strictly Periodic Scheduling Problem.
Clément PiraChristian ArtiguesPublished in: LION (2013)
Keyphrases
- scheduling problem
- tabu search
- list scheduling
- job shop scheduling problem
- single machine
- unrelated parallel machines
- multi depot
- randomly generated test problems
- parallel machine scheduling problem
- np hard
- strongly np hard
- processing times
- permutation flowshop
- flowshop
- quay crane
- optimal solution
- precedence constraints
- setup times
- feasible solution
- parallel machines
- sequence dependent setup times
- total tardiness
- heuristic methods
- minimizing makespan
- search procedure
- simulated annealing
- dynamic programming
- maximum lateness
- knapsack problem
- data structure