Journal article · 2026

The Complexity of Scheduling Pickup and Delivery Jobs

Tianyu Wang, Desheng Wu, David L. Olson

Operations Research · Published 13 November 2026 · DOI 10.1287/opre.2026.2625

View at the publisherCite this paper

In brief

“The Complexity of Scheduling Pickup and Delivery Jobs” is a 2026 journal article by Tianyu Wang and 2 co-authors, published in Operations Research. OpenAlex counts 0 citations as of 18 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
0
Authors
3

Abstract

Scheduling pickup and delivery jobs stands as a critical and challenging problem commonly encountered in time-sensitive logistics and transportation. Often, a large number of requests involving shipments from the same location are aggregated into either a fixed number of job queues, referred to as the queueing mode, or into a fixed number of sets, referred… Read the full abstract at the publisher.

Excerpt. This paper is not open access.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Wang, T., Wu, D., & Olson, D. L. (2026). The Complexity of Scheduling Pickup and Delivery Jobs. Operations Research. https://doi.org/10.1287/opre.2026.2625

MLA 9

Wang, Tianyu, et al. “The Complexity of Scheduling Pickup and Delivery Jobs.” Operations Research, 2026. https://doi.org/10.1287/opre.2026.2625.

Chicago

Wang, Tianyu, Desheng Wu, and David L. Olson. 2026. “The Complexity of Scheduling Pickup and Delivery Jobs.” Operations Research. https://doi.org/10.1287/opre.2026.2625.

Harvard

Wang, T., Wu, D. and Olson, D. L. (2026) ‘The Complexity of Scheduling Pickup and Delivery Jobs’, Operations Research. doi:10.1287/opre.2026.2625.

IEEE

T. Wang, D. Wu, and D. L. Olson, “The Complexity of Scheduling Pickup and Delivery Jobs,” Operations Research, 2026, doi: 10.1287/opre.2026.2625.

BibTeX

@article{wang2026complexity,
  title     = {{The Complexity of Scheduling Pickup and Delivery Jobs}},
  author    = {Wang, Tianyu and Wu, Desheng and Olson, David L.},
  journal   = {Operations Research},
  year      = {2026},
  doi       = {10.1287/opre.2026.2625},
  url       = {https://doi.org/10.1287/opre.2026.2625}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Vehicle Routing Optimization Methods

  • computational complexity
  • strong NP-hardness
  • request aggregation
  • waiting time minimization
  • total distance minimization
  • approximation algorithms
  • bipartite graphs
  • logistics routing

Work with this paper

Most-cited papers in Engineering

All highly cited Engineering papers

Questions about this paper

How do I cite this paper in APA style?

Wang, T., Wu, D., & Olson, D. L. (2026). The Complexity of Scheduling Pickup and Delivery Jobs. Operations Research. https://doi.org/10.1287/opre.2026.2625

How many times has this paper been cited?

0 times, according to OpenAlex on 18 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Tianyu Wang, Desheng Wu, David L. Olson.

What is the DOI of this paper?

10.1287/opre.2026.2625, permanently at https://doi.org/10.1287/opre.2026.2625. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 18 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.