This paper considers the product service scheduling problem with service matching. This problem is a complex scheduling problem that integrates multiple traveling salesman problem (MTSP) and multiple service types. To solve the problem, a tabu search method was presented. With the objective of minimizing the total of engineers’ travel distances, total of the customer penalty values, and makespan, an optimization model of this problem is established. The historical search solutions are taken as tabu object, and limiting the quantity of search neighborhood solution is taken as the aspiration level. At last, the adaptability, validity, and stability of the model are verified by an example.
Product Service Scheduling Problem with Service Matching Based on Tabu Search Method
2020
Article (Journal)
Electronic Resource
Unknown
Metadata by DOAJ is licensed under CC BY-SA 1.0
Tabu search for production scheduling problems
British Library Online Contents | 1995
|Models and Tabu Search Metaheuristics for Service Network Design with Asset-Balance Requirements
Online Contents | 2009
|A Tabu search technique applied to scheduling container transfers
Taylor & Francis Verlag | 2001
|A TABU SEARCH TECHNIQUE APPLIED TO SCHEDULING CONTAINER TRANSFERS
Online Contents | 2000
|