Approximation Algorithms on Multiple Two-Stage Flowshops

2018 ◽  
pp. 713-725 ◽  
Author(s):  
Guangwei Wu ◽  
Jianer Chen
Keyword(s):  
Approximation Algorithms ◽  
Two Stage

Two-stage submodular maximization problem beyond nonnegative and monotone

2021 ◽  
pp. 1-16
Author(s):  
Zhicheng Liu ◽  
Hong Chang ◽  
Ran Ma ◽  
Donglei Du ◽  
Xiaoyan Zhang
Keyword(s):  
Approximation Algorithms ◽  
Approximation Algorithm ◽  
Objective Function ◽  
Modular Function ◽  
Submodular Function ◽  
Maximization Problem ◽  
Cardinality Constraint ◽  
Two Stage ◽  
Time Efficiency ◽  
Submodular Maximization

Abstract We consider a two-stage submodular maximization problem subject to a cardinality constraint and k matroid constraints, where the objective function is the expected difference of a nonnegative monotone submodular function and a nonnegative monotone modular function. We give two bi-factor approximation algorithms for this problem. The first is a deterministic $\left( {{1 \over {k + 1}}\left( {1 - {1 \over {{e^{k + 1}}}}} \right),1} \right)$ -approximation algorithm, and the second is a randomized $\left( {{1 \over {k + 1}}\left( {1 - {1 \over {{e^{k + 1}}}}} \right) - \varepsilon ,1} \right)$ -approximation algorithm with improved time efficiency.

Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments

2020 ◽  
Vol 23 (5) ◽  
pp. 595-608 ◽  
Author(s):  
Jianming Dong ◽  
Joshua Chang ◽  
Bing Su ◽  
Jueliang Hu ◽  
Guohui Lin
Keyword(s):  
Approximation Algorithms ◽  
Flow Shop ◽  
Open Shop ◽  
Open Shop Scheduling ◽  
Two Stage ◽  
Shop Scheduling

Approximation Algorithms for a Two-Stage Hybrid Flow Shop

2012 ◽  
Vol 23 (5) ◽  
pp. 1073-1084 ◽  
Author(s):  
Qi WEI ◽  
Yi-Wei JIANG
Keyword(s):  
Approximation Algorithms ◽  
Flow Shop ◽  
Hybrid Flow Shop ◽  
Two Stage
Sign in / Sign up

Export Citation Format

Share Document