Computational performances of a simple interchange heuristic for a scheduling problem with an availability constraint.
Julien MoncelJérémie ThieryAriel WaserholePublished in: Comput. Ind. Eng. (2014)
Keyphrases
- scheduling problem
- randomly generated test problems
- tabu search
- dominance rules
- np hard
- computationally tractable
- flowshop
- optimal solution
- sufficiently accurate
- lagrangian relaxation
- computational power
- linear programming
- integer programming
- processing times
- knapsack problem
- single machine
- feasible solution
- permutation flowshop
- minimizing makespan
- simulated annealing
- list scheduling
- neural network