Vehicle scheduling with combinable delivery and pickup operations

Authors:
Chung-Yee Lee;Xiangtong Qi
Affiliations:
Department of Industrial Engineering and Logistics Management, The Hong Kong University of Science and Technology, Clearwater Bay, Kowloon, Hong Kong;Department of Industrial Engineering and Logistics Management, The Hong Kong University of Science and Technology, Clearwater Bay, Kowloon, Hong Kong
Venue:
Operations Research Letters
Year:
2009

Citing 8
Cited 0

One-processor scheduling with symmetric earliness and tardiness penalties

Mathematics of Operations Research
On the effectiveness of direct shipping strategy for the one-warehouse multi-retailer R-systems

Management Science
The vehicle routing problem

The vehicle routing problem
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The Stochastic Inventory Routing Problem with Direct Deliveries

Transportation Science
Single machine batch scheduling problem with family setup times and release dates to minimize makespan

Journal of Scheduling
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
Analysis of Direct Shipping Policies in an Inventory-Routing Problem with Discrete Shipping Times

Management Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by the logistics operations in an express delivery company, we develop and study a new scheduling model. The problem seems similar to scheduling with sequence-dependent setup times and scheduling with release times, however, the ability to combine or separate the job operations makes our problem unique.