Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination.
Jianming DongAn ZhangYong ChenQifan YangPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- approximation algorithms
- open shop scheduling
- batch processing
- np hard
- strongly np hard
- special case
- vertex cover
- minimum cost
- worst case
- ant colony optimisation
- set cover
- primal dual
- disjoint paths
- constant factor approximation
- combinatorial auctions
- open shop
- randomized algorithms
- objective function
- single machine
- optimal solution
- scheduling problem
- approximation ratio
- data mining
- test cases
- branch and bound algorithm