An optimal polynomial time algorithm for the common cycle economic lot and delivery scheduling problem.
Mikkel T. JensenMoutaz J. KhoujaPublished in: Eur. J. Oper. Res. (2004)
Keyphrases
- worst case
- np hard
- dynamic programming
- optimal solution
- scheduling problem
- learning algorithm
- computational complexity
- preprocessing
- computational cost
- optimization algorithm
- cost function
- expectation maximization
- single machine scheduling problem
- space complexity
- tabu search
- segmentation algorithm
- strongly np hard
- polynomial time complexity
- approximation guarantees
- optimal scheduling
- linear programming
- globally optimal
- branch and bound algorithm
- k means
- objective function
- similarity measure