Corrections of costs to feasible solutions of economic lot scheduling problems.
Kristina NilssonAnders SegerstedtPublished in: Comput. Ind. Eng. (2008)
Keyphrases
- feasible solution
- scheduling problem
- tabu search
- linear programming
- optimal solution
- solution quality
- single machine
- job shop scheduling problem
- objective function
- lagrangian relaxation
- flowshop
- mixed integer
- np hard
- solution space
- convex hull
- linear programming relaxation
- test problems
- processing times
- mathematical model
- mixed integer program
- extreme points
- integer solution
- linear program
- metaheuristic
- lower bound
- valid inequalities
- upper bound
- genetic algorithm