An efficient polynomial-time approximation scheme for parallel multi-stage open shops.
Jianming DongRuyan JinGuohui LinBing SuWeitian TongYao XuPublished in: CoRR (2022)
Keyphrases
- polynomial time approximation
- multistage
- identical machines
- approximation algorithms
- np hard
- error bounds
- production system
- single stage
- lot sizing
- stochastic programming
- dynamic programming
- stochastic optimization
- interconnection networks
- shared memory
- worst case
- lot streaming
- bin packing
- learning algorithm
- attack detection