| [1] |
Hao Xiao, Qian Liu, Yang Zhou, Min Li.
Approximation Algorithms for k-Submodular Maximization Subject to a Knapsack Constraint
[J]. Journal of the Operations Research Society of China, 2026, 14(2): 397-412.
|
| [2] |
Yan-Jun Qu, Ji Tian, Ru-Yan Fu, Kai-Jie Ge.
A Best Possible Online Algorithm for Single-Machine Scheduling with Non-delayed Processing Constraint and Bounded Delivery Times
[J]. Journal of the Operations Research Society of China, 2026, 14(2): 489-501.
|
| [3] |
Cheng He, Jing Wu, Hao Lin, Yuan Zhang, Yan Zhao.
The Unbounded Parallel-Batching Bicriteria Scheduling with Two-Component Jobs
[J]. Journal of the Operations Research Society of China, 2026, 14(2): 547-564.
|
| [4] |
Lan-Meng Meng, Ran Ma, Yu-Zhong Zhang.
Single-Machine Online Scheduling with Non-delayed Processing Constraint and Deterioration Effect in the Steel Rolling Process
[J]. Journal of the Operations Research Society of China, 2026, 14(2): 653-670.
|
| [5] |
Rui Guan, Dong-Yue Liang, Wei Wang, Wei-Hua Yang.
Direct Product Multicommodity Max-Concurrent-Flow Min-Sparse-Cut Theorem
[J]. Journal of the Operations Research Society of China, 2026, 14(2): 719-729.
|
| [6] |
Xin-Gong Zhang, Xiao-Min Tang.
The Two Single-Machine Scheduling Problems with Slack Due Date to Minimize Total Early Work and Late Work
[J]. Journal of the Operations Research Society of China, 2026, 14(1): 129-148.
|
| [7] |
Zhen Zhang, Zi-Yun Huang, Zhi-Ping Tian, Li-Mei Liu, Xue-Song Xu, Qi-Long Feng.
On the Budgeted Priority p-Median Problem in High-Dimensional Euclidean Spaces
[J]. Journal of the Operations Research Society of China, 2026, 14(1): 309-324.
|
| [8] |
Shu-Fang Gong, Bin Liu, Qi-Zhi Fang.
Streaming Algorithms for Maximizing k-Submodular Functions with the Multi-knapsack Constraint
[J]. Journal of the Operations Research Society of China, 2026, 14(1): 325-343.
|
| [9] |
Zhu-Yi-Nan Wang, Chen Zhang, Zhi-Yi Tan.
Scheduling Games with Potential Penalties on the Move of Jobs
[J]. Journal of the Operations Research Society of China, 2025, 13(4): 1157-1180.
|
| [10] |
Gong-Bo Zhang, Hao-Bin Li, Xiao-Tian Liu, Yi-Jie Peng.
Simulation Budget Allocation for Improving Scheduling and Routing of Automated Guided Vehicles in Warehouse Management
[J]. Journal of the Operations Research Society of China, 2025, 13(3): 775-809.
|
| [11] |
Jin Yu, Pei-Hai Liu, Xi-Wen Lu.
A Note on "Flowshop Scheduling with Learning Effectand Job Rejection"
[J]. Journal of the Operations Research Society of China, 2025, 13(2): 452-462.
|
| [12] |
Peng-Xiang Pan, Jun-Ran Lichen, Wen-Cheng Wang, Li-Jian Cai, Jian-Ping Li.
Approximation Algorithms for Solving the k-Chinese Postman Problem Under Interdiction Budget Constraints
[J]. Journal of the Operations Research Society of China, 2025, 13(2): 535-554.
|
| [13] |
Ru-Yan He, Jin-Jiang Yuan, Yuan Zhang.
The Single-Machine Preemptive or Resumable Scheduling with Maintenance Intervals
[J]. Journal of the Operations Research Society of China, 2025, 13(2): 590-602.
|
| [14] |
Li-Yun Miao, Ji Tian, Ru-Yan Fu.
A Best Possible Online Algorithm For Parallel-Batch Scheduling with Kind Release Times and Job Compatibilities
[J]. Journal of the Operations Research Society of China, 2025, 13(2): 603-615.
|
| [15] |
Pei-Jia Yang, Wen-Chang Luo.
Approximation Algorithm for the k-Product Uncapacitated Facility Location Problem with Penalties
[J]. Journal of the Operations Research Society of China, 2025, 13(1): 287-296.
|
