Technical Note - Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem.
Jacques ErschlerFrançois RoubellatJ. P. VernhesPublished in: Oper. Res. (1976)
Keyphrases
- feasible solution
- tabu search
- scheduling problem
- linear programming
- simulated annealing
- solution quality
- mixed integer
- lagrangian relaxation
- test problems
- metaheuristic
- convex hull
- np hard
- optimal solution
- mathematical model
- single machine
- objective function
- mixed integer program
- genetic algorithm
- extreme points
- flowshop
- linear programming relaxation
- neural network
- knapsack problem
- optimization algorithm
- learning algorithm
- infeasible solutions
- integer solution