| [1] |
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.
|
| [2] |
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.
|
| [3] |
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.
|
| [4] |
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.
|
| [5] |
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.
|
| [6] |
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.
|
| [7] |
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.
|
| [8] |
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.
|
| [9] |
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.
|
| [10] |
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.
|
| [11] |
Jian-Ping Li, Wen-Cheng Wang, Jun-Ran Lichen, Yu-Jie Zheng.
Approximation Algorithms for Constructing Steiner Trees in the Euclidean Plane R2 Using Stock Pieces of Materials with Fixed Length
[J]. Journal of the Operations Research Society of China, 2024, 12(4): 996-1021.
|
| [12] |
Fan-Yu Kong, Cui-Xia Miao, Yu-Jia Huo, Jia-Xin Song, Yu-Zhong Zhang.
Single-Machine Scheduling with Step-Deteriorating Jobs and Rejection
[J]. Journal of the Operations Research Society of China, 2024, 12(4): 1088-1102.
|
| [13] |
Dan-Yang Lv, Jing Xue, Ji-Bo Wang.
Minmax Common Due-Window Assignment Scheduling with Deteriorating Jobs
[J]. Journal of the Operations Research Society of China, 2024, 12(3): 681-693.
|
| [14] |
Jian-Ping Li, Su-Ding Liu, Jun-Ran Lichen, Peng-Xiang Pan, Wen-Cheng Wang.
Approximation Algorithms for Solving the 1-Line Minimum Steiner Tree of Line Segments Problem
[J]. Journal of the Operations Research Society of China, 2024, 12(3): 729-755.
|
| [15] |
Wei-Dong Li.
Improved Approximation Schemes for Early Work Scheduling on Identical Parallel Machines with a Common Due Date
[J]. Journal of the Operations Research Society of China, 2024, 12(2): 341-350.
|
