Some two-agent single-machine scheduling problems to minimize minmax and minsum of completion times.
Xiaoling CaoWen-Hsing WuWen-Hung WuChin-Chia WuPublished in: Oper. Res. (2018)
Keyphrases
- completion times
- single machine scheduling problem
- min sum
- branch and bound algorithm
- lower bound
- np hard
- release times
- single machine
- scheduling problem
- goal programming
- processing times
- combinatorial optimization
- lagrangian relaxation
- precedence constraints
- upper bound
- resource consumption
- min cut
- branch and bound
- weighted sum
- optimal solution
- hybrid algorithm
- worst case
- approximation algorithms
- lp relaxation
- objective function
- computational complexity
- image segmentation
- simulated annealing
- multi objective
- special case