An Improved Approximation Algorithm for the Two-Machine Flow Shop Scheduling Problem with an interstage transporter.
Alan J. SoperVitaly A. StrusevichPublished in: Int. J. Found. Comput. Sci. (2007)
Keyphrases
- scheduling problem
- np hard
- preprocessing
- detection algorithm
- learning algorithm
- times faster
- optimization algorithm
- dynamic programming
- computational cost
- improved algorithm
- matching algorithm
- cost function
- k means
- experimental evaluation
- significant improvement
- optimal solution
- approximation ratio
- neural network
- upper bound
- worst case
- special case
- tree structure
- search space
- list scheduling