A Branch-and-Price algorithm for a compressor scheduling problem.
Marcelo Wuttig FriskeLuciana S. BuriolEduardo CamponogaraPublished in: Comput. Ind. Eng. (2018)
Keyphrases
- np hard
- scheduling problem
- optimal solution
- detection algorithm
- learning algorithm
- times faster
- high accuracy
- significant improvement
- experimental evaluation
- segmentation algorithm
- dynamic programming
- cost function
- data sets
- computational cost
- k means
- lower bound
- preprocessing
- matching algorithm
- similarity measure
- linear programming
- input data
- computational complexity
- convex hull
- improved algorithm
- list scheduling