Vehicle scheduling problems with two agents on a line (original) (raw)

Abstract

This paper studies the two-agent vehicle scheduling problems on a line with the constraint that each job is processed after its release time. All jobs belong to agent A or agent B and each job is located at some vertex on the line. The vehicle starts from an initial vertex \(v_{0}\) to process all jobs. The objective of the problem is to find a route of the vehicle so as to minimize the makespan of agent A under the constraint condition that the makespan of agent B is no more than the threshold value Q. This problem can be expressed by the 3-field scheduling notations as \(line-1|r(v_{j}),~C_{max}^{B}\le Q|C_{max}^{A}\). For the problem without release time, we show this problem is solvable in polynomial time and an O(n) time algorithm is provided. For the problem with release time, we prove this problem is NP-hard and then, a \(\frac{3+\sqrt{5}}{2}\)-approximation algorithm is presented. Finally, we conclude the numerical experiments to evaluate the performance of the approximation algorithm.

Access this article

Log in via an institution

Subscribe and save

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Data availibility

The data in our numerical experiments are randomly generated by the uniform probability distribution.

References

Download references

Funding

This research was supported by the National Natural Science Foundation of China under Grant 11871213.

Author information

Authors and Affiliations

  1. East China University of Science and Technology, Shanghai, China
    Hao Yan, Peihai Liu & Xiwen Lu

Authors

  1. Hao Yan
  2. Peihai Liu
  3. Xiwen Lu

Corresponding author

Correspondence toXiwen Lu.

Ethics declarations

Conflict of interest

The authors declare that they have no relevant financial or non-financial interests.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

A preliminary result of this work has been published in the 15th Annual International Conference on Combinatorial Optimization and Applications (2021).

Appendix

Appendix

For the case that the right end vertex is belonging to agent A, the following algorithm is designed for \(line-1|r(v_{j})=0,~C_{max}^{B}\le Q|C_{max}^{A}\). Define \(M=\{v_{1}^{A},...,v_{j}^{A}\}\) be the vertex set of agent A located before \(v_{n_{B}}^{B}\) on the line.

figure c

We can also prove that this algorithm is an O(n) time algorithm in a similar way to Theorem 3.1 except for using below value ranges of Q. (1) \(2L^{A}-d(v_{0},v_{1}^{B})+H\le Q\); (2)\(L^{A}+d(v_{n_{A}}^{A},v_{n_{B}}^{B})+H\le Q< 2L^{A}-d(v_{0},v_{1}^{B})+H\); (3) \(L^{B}+P^{B}\le Q< L^{A}+d(v_{n_{A}}^{A},v_{n_{B}}^{B})+H\); (4) \(Q< L^{B}+P^{B}\). So we have shown that the problem \(line-1|r(v_{j})=0,~C_{max}^{B}\le Q|C_{max}^{A}\) is polynomially solvable.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Cite this article

Yan, H., Liu, P. & Lu, X. Vehicle scheduling problems with two agents on a line.J Comb Optim 45, 10 (2023). https://doi.org/10.1007/s10878-022-00933-3

Download citation

Keywords