| [1] |
Ru-Bing Chen, Ling-Fa Lu, Jin-Jiang Yuan, Li-Qi Zhang.
Improved Approximation Algorithm for Scheduling on a Serial Batch Machine with Split-Allowed Delivery
[J]. Journal of the Operations Research Society of China, 2020, 8(1): 133-143.
|
| [2] |
Wen-Chang Luo.
On Scheduling a Deteriorating Rate-Modifying Activity to Minimize the Number of Tardy Jobs
[J]. Journal of the Operations Research Society of China, 2020, 8(1): 165-175.
|
| [3] |
Qi Feng, Wei-Ping Shang, Cheng-Wen Jiao, Wen-Jie Li.
Two-Agent Scheduling on a Bounded Parallel-Batching Machine with Makespan and Maximum Lateness Objectives
[J]. Journal of the Operations Research Society of China, 2020, 8(1): 189-196.
|
| [4] |
Yao Xu, Yong Chen, Peng Zhang, Randy Goebel.
Approximation Algorithms for Vertex Happiness
[J]. Journal of the Operations Research Society of China, 2019, 7(3): 429-448.
|
| [5] |
Yong Chen, Guang-Ting Chen, Long-Cheng Liu, Yi-Wei Jiang, Zhi-Yi Tan, An Zhang.
Online Scheduling with Unit Processing Times and Processing Set Restrictions
[J]. Journal of the Operations Research Society of China, 2019, 7(3): 475-484.
|
| [6] |
Long Wan, Jin-Jiang Yuan.
Simultaneous Approximation Ratios for Parallel Machine Scheduling Problems
[J]. Journal of the Operations Research Society of China, 2019, 7(3): 485-500.
|
| [7] |
Jin-Jiang Yuan, Li-Li Ren, Ji Tian, Ru-Yan Fu.
Online Scheduling on Two Uniform Unbounded Parallel-Batch Machines to Minimize Makespan
[J]. Journal of the Operations Research Society of China, 2019, 7(2): 303-319.
|
| [8] |
Tao-Ran Fu, Jin-Yan Fan.
Successive Partial-Symmetric Rank-One Algorithms for Almost Unitarily Decomposable Conjugate Partial-Symmetric Tensors
[J]. Journal of the Operations Research Society of China, 2019, 7(1): 147-167.
|
| [9] |
Juan Zou, Jin-Jiang Yuan.
Equivalence of Some Different Maintenance Activities in Single-Machine Scheduling
[J]. Journal of the Operations Research Society of China, 2018, 6(4): 545-556.
|
| [10] |
Wen-Hua Li, Xing Chai.
Online Scheduling on Bounded Batch Machines to Minimize the MaximumWeighted Completion Time
[J]. Journal of the Operations Research Society of China, 2018, 6(3): 455-466.
|
| [11] |
Ling-Fa Lu, Li-Qi Zhang.
Competitive Project Scheduling on Two Unbounded Parallel Batch Machines
[J]. Journal of the Operations Research Society of China, 2018, 6(3): 473-483.
|
| [12] |
Xian-Yu Yu· De-Qun Zhou · Yu-Lin Zhang.
The Study of Group Scheduling Problems with General Dual-Position-Based Job Processing Times
[J]. Journal of the Operations Research Society of China, 2017, 5(4): 509-527.
|
| [13] |
Li-Ya Yang · Xi-Wen Lu.
Two-Agent Supply Chain Scheduling Problem to Minimize the Sum of the Total Weighted Completion Time and Batch Cost
[J]. Journal of the Operations Research Society of China, 2017, 5(2): 257-.
|
| [14] |
Lu Han · Da-Chuan Xu · Dong-Lei Du·Chen-Chen Wu.
A Primal-Dual Algorithm for the Generalized Prize-Collecting Steiner Forest Problem
[J]. Journal of the Operations Research Society of China, 2017, 5(2): 219-.
|
| [15] |
.
The Shortest First Coordination Mechanism for a Scheduling Game with Parallel-Batching Machines
[J]. Journal of the Operations Research Society of China, 2016, 4(4): 517-.
|
