An Efficient A* Like Algorithm for the Scheduling of Unit-Time Jobs with Release and Due Dates under Non Idling Constraints.
Philippe ChrétienneAlain QuilliotHélène ToussaintPublished in: CoDIT (2023)
Keyphrases
- multiple constraints
- computationally efficient
- objective function
- optimization algorithm
- search space
- np hard
- dynamic programming
- worst case
- simulated annealing
- optimal scheduling
- constrained optimization
- detection algorithm
- learning algorithm
- computational complexity
- optimal solution
- special case
- k means
- resource constraints
- parallel machines
- lower and upper bounds
- scheduling strategy
- image segmentation