@article{
 title = {The aircraft maintenance base location problem},
 type = {article},
 year = {2014},
 identifiers = {[object Object]},
 keywords = {Air transportation,Aircraft maintenance,Approximation algorithms,Computational complexity,Facility location},
 pages = {634-642},
 volume = {236},
 websites = {http://linkinghub.elsevier.com/retrieve/pii/S0377221714000095},
 month = {7},
 publisher = {Elsevier B.V.},
 id = {0f7e52c2-8105-3c36-94b5-2d573d82ccbe},
 created = {2015-03-23T18:50:24.000Z},
 accessed = {2014-08-21},
 file_attached = {true},
 profile_id = {756a70ce-605d-3e50-9cbb-a99c29afcbe8},
 group_id = {1f5b486a-d8ac-3a35-9104-56111360dab7},
 last_modified = {2017-03-14T11:36:44.206Z},
 read = {true},
 starred = {false},
 authored = {false},
 confirmed = {true},
 hidden = {false},
 citation_key = {Gopalan2014},
 private_publication = {false},
 abstract = {Aviation authorities such as the Federal Aviation Administration (FAA) provide stringent guidelines for aircraft maintenance, with violations leading to significant penalties for airlines. Moreover, poorly maintained aircraft can lead to mass cancellation of flights, causing tremendous inconvenience to passengers and resulting in a significant erosion in brand image for the airline in question. Aircraft maintenance operations of a complex and extended nature can only be performed at designated maintenance bases. Aircraft maintenance planning literature has focused on developing good tail-number routing plans, while assuming that the locations of the maintenance bases themselves are fixed. This paper considers an inverse optimization problem, viz.; locating a minimal number of maintenance bases on an Euler tour, while ensuring that all required aircraft maintenance activities can be performed with a stipulated periodicity. The Aircraft Maintenance Base Location Problem (AMBLP) is shown to be NP-complete and a new lower bound is developed for the problem. The performance of four simple "quick and dirty" heuristics for obtaining feasible solutions to AMBLP is analyzed. ?? 2014 Elsevier B.V. All rights reserved.},
 bibtype = {article},
 author = {Gopalan, Ram},
 journal = {European Journal of Operational Research},
 number = {2}
}

{"_id":"7cBTBqYdN5GKAKnmd","bibbaseid":"gopalan-theaircraftmaintenancebaselocationproblem-2014","downloads":0,"creationDate":"2018-03-26T07:07:40.633Z","title":"The aircraft maintenance base location problem","author_short":["Gopalan, R."],"year":2014,"bibtype":"article","biburl":null,"bibdata":{"title":"The aircraft maintenance base location problem","type":"article","year":"2014","identifiers":"[object Object]","keywords":"Air transportation,Aircraft maintenance,Approximation algorithms,Computational complexity,Facility location","pages":"634-642","volume":"236","websites":"http://linkinghub.elsevier.com/retrieve/pii/S0377221714000095","month":"7","publisher":"Elsevier B.V.","id":"0f7e52c2-8105-3c36-94b5-2d573d82ccbe","created":"2015-03-23T18:50:24.000Z","accessed":"2014-08-21","file_attached":"true","profile_id":"756a70ce-605d-3e50-9cbb-a99c29afcbe8","group_id":"1f5b486a-d8ac-3a35-9104-56111360dab7","last_modified":"2017-03-14T11:36:44.206Z","read":"true","starred":false,"authored":false,"confirmed":"true","hidden":false,"citation_key":"Gopalan2014","private_publication":false,"abstract":"Aviation authorities such as the Federal Aviation Administration (FAA) provide stringent guidelines for aircraft maintenance, with violations leading to significant penalties for airlines. Moreover, poorly maintained aircraft can lead to mass cancellation of flights, causing tremendous inconvenience to passengers and resulting in a significant erosion in brand image for the airline in question. Aircraft maintenance operations of a complex and extended nature can only be performed at designated maintenance bases. Aircraft maintenance planning literature has focused on developing good tail-number routing plans, while assuming that the locations of the maintenance bases themselves are fixed. This paper considers an inverse optimization problem, viz.; locating a minimal number of maintenance bases on an Euler tour, while ensuring that all required aircraft maintenance activities can be performed with a stipulated periodicity. The Aircraft Maintenance Base Location Problem (AMBLP) is shown to be NP-complete and a new lower bound is developed for the problem. The performance of four simple \"quick and dirty\" heuristics for obtaining feasible solutions to AMBLP is analyzed. ?? 2014 Elsevier B.V. All rights reserved.","bibtype":"article","author":"Gopalan, Ram","journal":"European Journal of Operational Research","number":"2","bibtex":"@article{\n title = {The aircraft maintenance base location problem},\n type = {article},\n year = {2014},\n identifiers = {[object Object]},\n keywords = {Air transportation,Aircraft maintenance,Approximation algorithms,Computational complexity,Facility location},\n pages = {634-642},\n volume = {236},\n websites = {http://linkinghub.elsevier.com/retrieve/pii/S0377221714000095},\n month = {7},\n publisher = {Elsevier B.V.},\n id = {0f7e52c2-8105-3c36-94b5-2d573d82ccbe},\n created = {2015-03-23T18:50:24.000Z},\n accessed = {2014-08-21},\n file_attached = {true},\n profile_id = {756a70ce-605d-3e50-9cbb-a99c29afcbe8},\n group_id = {1f5b486a-d8ac-3a35-9104-56111360dab7},\n last_modified = {2017-03-14T11:36:44.206Z},\n read = {true},\n starred = {false},\n authored = {false},\n confirmed = {true},\n hidden = {false},\n citation_key = {Gopalan2014},\n private_publication = {false},\n abstract = {Aviation authorities such as the Federal Aviation Administration (FAA) provide stringent guidelines for aircraft maintenance, with violations leading to significant penalties for airlines. Moreover, poorly maintained aircraft can lead to mass cancellation of flights, causing tremendous inconvenience to passengers and resulting in a significant erosion in brand image for the airline in question. Aircraft maintenance operations of a complex and extended nature can only be performed at designated maintenance bases. Aircraft maintenance planning literature has focused on developing good tail-number routing plans, while assuming that the locations of the maintenance bases themselves are fixed. This paper considers an inverse optimization problem, viz.; locating a minimal number of maintenance bases on an Euler tour, while ensuring that all required aircraft maintenance activities can be performed with a stipulated periodicity. The Aircraft Maintenance Base Location Problem (AMBLP) is shown to be NP-complete and a new lower bound is developed for the problem. The performance of four simple \"quick and dirty\" heuristics for obtaining feasible solutions to AMBLP is analyzed. ?? 2014 Elsevier B.V. All rights reserved.},\n bibtype = {article},\n author = {Gopalan, Ram},\n journal = {European Journal of Operational Research},\n number = {2}\n}","author_short":["Gopalan, R."],"urls":{"Paper":"https://bibbase.org/service/mendeley/756a70ce-605d-3e50-9cbb-a99c29afcbe8/file/2cb6d85a-0d78-7e37-5d7f-b89d78e9c1b4/2014-The_aircraft_maintenance_base_location_problem.pdf.pdf","Website":"http://linkinghub.elsevier.com/retrieve/pii/S0377221714000095"},"bibbaseid":"gopalan-theaircraftmaintenancebaselocationproblem-2014","role":"author","keyword":["Air transportation","Aircraft maintenance","Approximation algorithms","Computational complexity","Facility location"],"downloads":0},"search_terms":["aircraft","maintenance","base","location","problem","gopalan"],"keywords":["air transportation","aircraft maintenance","approximation algorithms","computational complexity","facility location"],"authorIDs":[]}