An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time.
György DósaHans KellererTomas OlajZsolt TuzaPublished in: Theor. Comput. Sci. (2021)
Keyphrases
- lower and upper bounds
- learning algorithm
- computational complexity
- cost function
- upper bound
- preprocessing
- k means
- objective function
- upper and lower bounds
- np hard
- energy function
- multi step
- real world
- convergence rate
- mathematical model
- segmentation algorithm
- linear programming
- simulated annealing
- worst case
- denoising
- search space
- lower bound