An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions.
Emerson C. ColinRoberto da Costa QuininoPublished in: Comput. Oper. Res. (2005)
Keyphrases
- single machine scheduling problem
- cost function
- computational complexity
- precedence constraints
- dynamic programming
- scheduling problem
- optimization algorithm
- optimal solution
- release dates
- convex hull
- combinatorial optimization
- objective function
- worst case
- ant colony optimization
- computational efficiency
- np hard
- search space
- branch and bound algorithm
- solution quality
- lower bound
- search algorithm