A new lower bound for the open‐shop problem.
Christelle GuéretChristian PrinsPublished in: Ann. Oper. Res. (1999)
Keyphrases
- open shop
- lower bound
- approximation algorithms
- job shop
- np hard
- upper bound
- worst case
- branch and bound algorithm
- multistage
- branch and bound
- objective function
- parallel machines
- lower and upper bounds
- optimal solution
- scheduling problem
- special case
- job shop scheduling
- flowshop
- lagrangian relaxation
- completion times
- production scheduling
- minimum cost
- global optimization
- resource constrained
- data streams
- sensor networks