A branch-and-price algorithm for robust parallel batch scheduling problem with uncertain size.
Ting WangXiaoling ShaoXue YanPublished in: Ind. Manag. Data Syst. (2022)
Keyphrases
- np hard
- scheduling problem
- parallel implementation
- worst case
- computationally efficient
- k means
- memory requirements
- optimal solution
- learning algorithm
- search space
- dynamic programming
- cost function
- times faster
- worst case time complexity
- window size
- particle swarm optimization
- linear programming
- simulated annealing
- significant improvement
- preprocessing
- detection algorithm
- matching algorithm
- parameter tuning
- lower bound
- fixed size
- scales linearly
- object tracking algorithm