An Optimal Online Algorithm for Scheduling on Two Parallel Machines with GoS Eligibility Constraints

Journal of the Operations Research Society of China

• Discrete Optimization • Previous Articles Next Articles

An Optimal Online Algorithm for Scheduling on Two Parallel Machines with GoS Eligibility Constraints

Online:2016-09-30 Published:2016-09-30

Abstract

Jia Xu， Zhao-Hui Liu. An Optimal Online Algorithm for Scheduling on Two Parallel Machines with GoS Eligibility Constraints[J]. Journal of the Operations Research Society of China.

TrendMD

[1]	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.
[2]	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.
[3]	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.
[4]	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.
[5]	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-.
[6]	. 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-.
[7]	Jin-Jiang Yuan. Complexities of Some Problems on Multi-agent Scheduling on a Single Machine [J]. Journal of the Operations Research Society of China, 2016, 4(3): 379-.
[8]	Ran Ma · Jin-Jiang Yuan. Online Scheduling with Rejection to Minimize the Total Weighted Completion Time Plus the Total Rejection Cost on Parallel Machines [J]. Journal of the Operations Research Society of China, 2016, 4(1): 111-.
[9]	Yuan Gao · Jin-Jiang Yuan. Pareto Minimizing Total Completion Time and Maximum Cost with Positional Due Indices [J]. Journal of the Operations Research Society of China, 2015, 3(3): 381-.
[10]	Lin Chen · Wen-Chang Luo · Guo-Chuan Zhang. On Two-machine Flow Shop Scheduling [J]. Journal of the Operations Research Society of China, 2014, 2(3): 333-340.

An Optimal Online Algorithm for Scheduling on Two Parallel Machines with GoS Eligibility Constraints

PDF

Knowledge

Cited

Abstract

Cite this article

share this article

References

Related Articles 10

Recommended Articles

Metrics

Comments