A Polynomial Algorithm for an open Shop Problem with Unit Processing Times and Tree Constraints.
Heidemarie BräselDavid KlugeFrank WernerPublished in: Discret. Appl. Math. (1995)
Keyphrases
- processing times
- worst case performance ratio
- single machine scheduling problem
- cost function
- dynamic programming
- benchmark problems
- worst case
- objective function
- open shop
- mathematical model
- particle swarm optimization
- linear programming
- convex hull
- scheduling problem
- np hard
- computational complexity
- optimal solution
- neural network