A rescheduling framework for the customer visit scheduling problem of a salesperson

Abstract This study introduces a dynamic customer visit scheduling problem of a salesperson. The aim of the salesperson is to make frequent visits to the customers by prioritizing the customers with higher urgency levels. The urgency levels of the customers are subject to change depending on new information about their willingness to make a future purchase. The updated information about the customer urgency level is obtained by visiting the customer or by receiving an urgent call from the customer. To accommodate the changes in the customer urgency levels, the customer visits need to be rescheduled. In this regard, we propose a rescheduling framework for the problem. The proposed framework consists of two integer programming formulations, namely, scheduling and rescheduling models. The scheduling model generates a baseline customer visit schedule. The rescheduling model is employed to develop new customer visit schedule by considering the stability of certain visits. To control the timing of rescheduling decisions, we considered two alternative rescheduling policies, namely, periodic and event-driven rescheduling policies. An application of the proposed framework is presented on a case study of the customer visit scheduling in a vehicle manufacturer. The computational results reveal that the proposed framework with periodic rescheduling policy provides efficient visit schedules under the schedule stability constraints.

Authors

Institutions

Publication Details

Journal
Computational and Applied Mathematics
Published
2026-02-03
DOI
https://doi.org/10.1007/s40314-026-03623-6
Primary Topic
Scheduling and Timetabling Solutions
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A rescheduling framework for the customer visit scheduling problem of a salesperson

Mualla Gonca Avci, Melisa Akkus, Aybuke Onar
Computational and Applied Mathematics
Scheduling and Timetabling Solutions
article

A rescheduling framework for the customer visit scheduling problem of a salesperson

Mualla Gonca Avci, Melisa Akkus, Aybuke Onar
article en

Abstract

Abstract This study introduces a dynamic customer visit scheduling problem of a salesperson. The aim of the salesperson is to make frequent visits to the customers by prioritizing the customers with higher urgency levels. The urgency levels of the customers are subject to change depending on new information about their willingness to make a future purchase. The updated information about the customer urgency level is obtained by visiting the customer or by receiving an urgent call from the customer. To accommodate the changes in the customer urgency levels, the customer visits need to be rescheduled. In this regard, we propose a rescheduling framework for the problem. The proposed framework consists of two integer programming formulations, namely, scheduling and rescheduling models. The scheduling model generates a baseline customer visit schedule. The rescheduling model is employed to develop new customer visit schedule by considering the stability of certain visits. To control the timing of rescheduling decisions, we considered two alternative rescheduling policies, namely, periodic and event-driven rescheduling policies. An application of the proposed framework is presented on a case study of the customer visit scheduling in a vehicle manufacturer. The computational results reveal that the proposed framework with periodic rescheduling policy provides efficient visit schedules under the schedule stability constraints.

Computational and Applied MathematicsVol. 45(6)
Dokuz Eylül University (TR)
Openalex Percentile: Top 73%
Scheduling and Timetabling Solutions
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.