An iterative lower bound algorithm for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization.
Walid HfaiedhCherif SadfiImed KacemAtidel B. Hadj-AlouanePublished in: CoDIT (2014)
Keyphrases
- single machine scheduling problem
- objective function
- lower bound
- cost function
- worst case
- optimal solution
- simulated annealing
- optimization algorithm
- combinatorial optimization
- computational efficiency
- single machine
- sequence dependent setup times
- space complexity
- cost model
- branch and bound algorithm
- linear programming
- upper bound
- search space
- computational complexity