APractical Sub-Optimal Solution for the Dual Priority Scheduling Problem.
Tristan FautrelLaurent GeorgeJoël GoossensDamien MassonPaul RodríguezPublished in: SIES (2018)
Keyphrases
- scheduling problem
- optimal solution
- np hard
- single machine
- flowshop
- tabu search
- linear programming
- linear program
- feasible solution
- knapsack problem
- primal dual
- setup times
- metaheuristic
- processing times
- duality gap
- total tardiness
- solution quality
- integer programming
- objective function
- branch and bound algorithm
- minimizing makespan
- search space
- priority scheduling
- permutation flowshop
- lower bound
- parallel machines
- preemptive scheduling
- greedy heuristic
- obtain the optimal solution
- precedence constraints
- job shop scheduling problem
- global optimum
- sequence dependent setup times
- strongly np hard
- total cost
- approximation algorithms
- priority queue
- hybrid algorithm
- branch and bound
- neural network
- iterative procedure
- production scheduling
- locally optimal
- higher priority
- special case
- evolutionary algorithm