A linear time approximation algorithm for permutation flow shop scheduling.
Marcus PoggiDavid SoteloPublished in: Theor. Comput. Sci. (2012)
Keyphrases
- worst case
- learning algorithm
- experimental evaluation
- detection algorithm
- cost function
- computational cost
- optimization algorithm
- classification algorithm
- theoretical analysis
- improved algorithm
- optimal solution
- np hard
- approximation ratio
- data sets
- tree structure
- recognition algorithm
- simple polygon
- error bounds
- convex hull
- closed form
- segmentation algorithm
- expectation maximization
- input data
- high accuracy
- dynamic programming
- lower bound
- preprocessing
- objective function