2012
DOI: 10.1016/j.dss.2012.01.013
|View full text |Cite
|
Sign up to set email alerts
|

On the impact of real-time information on field service scheduling

Abstract: Mobile phone operators need to plan and schedule field force personnel for maintenance and repair tasks on mobile phone base stations across the country on a daily basis. In this paper, we will introduce the field force scheduling problem with priorities. Motivated by the rising popularity of mobile field force management solutions, we compare online and offline heuristics as well as hybrids to solve the problem. The results help understand the benefits of dynamic scheduling based on realtime position informat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 22 publications
(16 citation statements)
references
References 35 publications
0
16
0
Order By: Relevance
“…An adaptive variable neighbourhood search improves solutions constructed by a randomised heuristic. Petrakis et al (2012) investigate different off-line and on-line mobile field force management solutions to schedule staff for maintenance and repair of mobile-phone base stations. Their results show that travel times are often lower in on-line solutions and that deadline penalties are considerably reduced.…”
Section: Literature Reviewmentioning
confidence: 99%
“…An adaptive variable neighbourhood search improves solutions constructed by a randomised heuristic. Petrakis et al (2012) investigate different off-line and on-line mobile field force management solutions to schedule staff for maintenance and repair of mobile-phone base stations. Their results show that travel times are often lower in on-line solutions and that deadline penalties are considerably reduced.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Most of the academic work is focused on route optimisation without assigning the right person to customers (Agnihothri, Sivasubramaniam, and Simmons 2002;Tang, Wilson, and Perevalov 2008;Petrakis, Hass, and Bichler 2012;Tricoire et al 2013). And the cooperation of engineers also hasn't received adequate attention in the problems modelling and algorithm designing.…”
Section: Introductionmentioning
confidence: 99%
“…Given this, this paper seeks to fill a gap in the literature by presenting a 0-1 programming model. The planning problem has similarities with different types of vehicle routing problem and vehicle routing problem with time windows, which were proved to be NP-hard by Petrakis, Hass, and Bichler (2012) and Solomon (1986). Therefore, the improved non-dominated sorting genetic algorithm-II (NSGA-II) is adopted to deal with this issue.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…This section briefly summarises some of the papers dealing with real-life examples of successful implementations of results from projects that have had a significant beneficial impact on the daily operations of a company and on their bottom-line. Papers on well-defined scheduling and rostering problems that assign tasks to the field workforce are not included here, since these do not take the travel times and routing constraints into account [18].…”
Section: Application Areasmentioning
confidence: 99%