Scheduling Technicians for Planned Maintenance of Geographically Distributed Equipment
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.
- Record URL:
-
Availability:
- Find a library where document is available. Order URL: http://worldcat.org/issn/13665545
-
Supplemental Notes:
- Abstract reprinted with permission from Elsevier
-
Authors:
- Tang, Hao
- Miller-Hooks, Elise
- Tomastik, Robert
- Publication Date: 2007-9
Language
- English
Media Info
- Media Type: Print
- Features: Figures; References; Tables;
- Pagination: pp 591-609
-
Serial:
- Transportation Research Part E: Logistics and Transportation Review
- Volume: 43
- Issue Number: 5
- Publisher: Elsevier
- ISSN: 1366-5545
- Serial URL: http://www.sciencedirect.com/science/journal/13665545
Subject/Index Terms
- TRT Terms: Commercial buildings; Distributed control; Equipment maintenance; Heuristic methods; Maximum likelihood method; Numerical analysis; Personnel; Problem solving; Scheduling; Tabu search; Time dependence; Traveling salesman problem
- Subject Areas: Highways; Maintenance and Preservation; Planning and Forecasting; Society; Terminals and Facilities; I72: Traffic and Transport Planning;
Filing Info
- Accession Number: 01055942
- Record Type: Publication
- Files: TRIS
- Created Date: Aug 29 2007 7:56AM