Scheduling technicians for planned maintenance of geographically distributed equipment |
| |
| Institution: | 1. Operations Research Group, FedEx Express Corporation, Memphis, TN 38125, United States;2. Department of Civil and Environmental Engineering, University of Maryland, 1173 Glenn L. Martin Hall, College Park, MD 20742, United States;3. United Technologies Research Center, United Technologies Corporation, East Hartford, CT 06108, United States;1. Department of Information Management, Chang Gung University, 259 Wen-Hwa 1st Road, Kwei-Shan, Taoyuan 333, Taiwan;2. Department of Medical Research and Development, Linkou Chang Gung Memorial Hospital, 5, Fusing St., Kwei-Shan, Taoyuan 333, Taiwan;3. Department of Industrial Management, National Taiwan University of Science and Technology, 43, Section 4, Keelung Road, Taipei 106, Taiwan |
| |
| Abstract: | A real-world planned maintenance scheduling problem that exists at several business units within United Technologies Corporation (UTC) is addressed in this paper. The scheduling problem is formulated as a multiple tour maximum collection problem with time-dependent rewards and an adaptive memory tabu search heuristic is developed to solve it. The effectiveness of the proposed solution approach is examined using real-world problem instances supplied by UTC. Relevant upper bounds are derived for the application. Results of numerical experiments indicate that the proposed tabu search heuristic is able to obtain near optimal solutions for large-size (i.e., actual) problem instances in reasonable computation time. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
