An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan.
Ruyan FuT. C. E. ChengC. T. NgJinjiang YuanPublished in: Oper. Res. Lett. (2013)
Keyphrases
- dynamic programming
- optimal solution
- worst case
- improved algorithm
- times faster
- objective function
- computational complexity
- significant improvement
- batch mode
- experimental evaluation
- cost function
- online learning
- optimal parameters
- simulated annealing
- optimization algorithm
- matching algorithm
- closed form
- learning algorithm
- parallel implementation
- detection algorithm
- exhaustive search
- segmentation algorithm
- recognition algorithm
- input data
- probabilistic model
- mobile robot
- np hard
- search space
- preprocessing
- similarity measure
- real time
- parallel computing
- optimal path
- globally optimal
- optimality criterion
- weighting coefficients
- hardware implementation
- clustering method
- particle swarm optimization
- linear programming
- high accuracy
- computational cost
- search algorithm
- genetic algorithm