Patent Grant
8849690
The present disclosure relates in general to a system and method for maintenance planning, and in particular to a system and method for aircraft maintenance planning.
In an exemplary embodiment, as illustrated in
As shown in
As shown in
In an exemplary embodiment, the server 18 is a web application server. In an exemplary embodiment, the module 17 is, includes, or is at least a part of, a web-based program, an Intranet-based program, and/or any combination thereof. In an exemplary embodiment, the module 17 and/or one or more components thereof, the computer readable medium 20 and/or content stored therein, the database 22 and/or content stored therein, and/or any combination thereof, are part of, and/or are distributed throughout, the system 10 and/or one or more of the components thereof, including, for example, one or more of the user devices 24 and 30. In an exemplary embodiment, the network 26 includes the Internet, one or more local area networks, one or more wide area networks, one or more cellular networks, one or more wireless networks, one or more voice networks, one or more data networks, one or more communication systems, and/or any combination thereof. In several exemplary embodiments, the respective quantities of one or more of the components and/or parts of the system 10, such as, for example, the respective quantities of the module 17, the server 18, the computer readable medium 20, the database 22, the user device 24 and the user device 30, are increased, decreased or otherwise varied.
In an exemplary embodiment, as illustrated in
In an exemplary embodiment, the user device 30 is, includes, or is at least a part of, the module 17, the server 18, the computer readable medium 20, the database 22, and/or any combination thereof. In several exemplary embodiments, the user device 30 is a thin client and the server 18 controls at least a portion of the operation of the user device 30. In several exemplary embodiments, the user device 30 is a thick client. In several exemplary embodiments, the user device 30 functions as both a thin client and a thick client. In several exemplary embodiments, the user device 30 is, or includes, a telephone, a personal computer, a portable computer, a personal digital assistant, a cellular telephone, a smart phone, other types of telecommunications devices, other types of computing devices, and/or any combination thereof. In several exemplary embodiments, the user device 30 is, or at least includes, the module 17.
In an exemplary embodiment, the user device 24 is substantially identical to the user device 30. Reference numerals used to refer to the components of the user device 24 that are substantially identical to the components of the user device 30 will correspond to the reference numerals used to refer to the components of the user device 30, except that the prefix for the reference numerals used to the describe the user device 30, that is, 30, will be replaced by the prefix of the user device 24, that is, 24. In several exemplary embodiments, one of the user devices 24 and 30 is omitted in favor of the other of the user devices 24 and 30. In several exemplary embodiments, the user device 24 is combined in whole or in part with the user device 30.
In several exemplary embodiments, the platforms of the server 18 and the user devices 24 and 30 are identical, different, or vary with respect to equipment, peripherals, hardware architecture and/or specifications, software architecture and/or specifications, and/or any combination thereof.
In an exemplary embodiment, as illustrated in
In an exemplary embodiment, to receive data associated with the bills of work 18a, 18b and 18c in the step 38, a program such as, for example, a web browser, is executed by the processor 30b of the user device 30 at the maintenance operations center 28, and/or by the processor 24b of the user device 24 at the line maintenance station 12, thereby causing the web browser to access a website hosted by the server 18, which website provides access to one or more programs and data stored in one or more of the computer readable medium 20 and the database 22, with the accessed data stored in the one or more of the computer readable medium 20 and the database 22 having been received from one or more of the following data sources: one or more of the user devices 24 and 30; a dispatch environmental control system (DECS) (not shown) and/or one or more computer systems, host-based systems and/or applications thereof; an enhanced reservation system (RES) (not shown) and/or one or more computer systems, host-based systems and/or applications thereof; the Federal Aviation Administration (FAA) (not shown) and/or one or more computer systems, host-based systems and/or applications thereof; off-schedule operations (OSO) (not shown) and/or one or more computer systems, host-based systems and/or applications thereof; the flight operating system (FOS) 32 and/or one or more computer systems, host-based systems and/or applications thereof; the applications 34 and/or one or more computer systems, host-based systems and/or applications thereof, and an aircraft communication addressing and reporting system (ACARS) (not shown) and/or one or more computer systems, host-based systems and/or applications thereof. In an exemplary embodiment, to receive data in the step 38, data is accessed from the module 17, but at least a portion of the accessed data is not stored in the module 17, with the server 18 instead accessing the at least a portion of the data from one or more of the data sources noted above.
In an exemplary embodiment, during the execution of the method 36, the data received in the step 38 is continually and automatically updated, continually and automatically updated at predetermined time intervals, and/or any combination thereof, thereby ensuring that the data received in the step 38 remains current and accurate. In an exemplary embodiment, the step 38 further includes refreshing the received data with recent updates of the data from the module 17 and/or the aforementioned one or more data sources, issuing one or more queries for updated data from the module 17 and/or the aforementioned one or more data sources, issuing one or more queries for updated data from the module 17 and/or the aforementioned one or more data sources at predetermined time intervals, issuing one or more queries for all of the data previously received in the step 38, issuing one or more queries for all of the data previously received in the step 38 at predetermined time intervals, and/or any combination thereof.
In an exemplary embodiment, to receive data associated with the maintenance capacity parameters 16 in the step 40, the data is accessed in a manner substantially similar to the above-described manner in which data is accessed is the step 38.
In an exemplary embodiment, to detect a trigger event in the step 42, an express or inferred event that triggers the execution of the steps 44, 46, 48 and 50 is detected. In an exemplary embodiment, the express event may be one or more user requests by one or more personnel at the maintenance operations center 28, and/or at the line maintenance station 12, for the automatic generation of an optimized bill of work for the line maintenance station 12. In an exemplary embodiment, the inferred event may be the expiration of a predetermined time period subsequent to the most recently generated optimized bill of work for the line maintenance station 12. In an exemplary embodiment, the inferred event is when a data item upon which a portion of a previous optimized bill of work for the line maintenance station 12 was based has been modified. In an exemplary embodiment, the trigger event detected in the step 42 is one or more of the following: a routing change for the airplane 14a, 14b or 14c to a different line maintenance station; a change in the departure and/or arrival times for the airplane 14a, 14b or 14c; a status change at the maintenance operations center 28 (assign, lock down, lock out, etc.); a change in one or more of the maintenance capacity parameters 16, a change in the manhours parameter 16a, a change in the parking parameter 16b, a parking decision change; a change in parts (e.g., spare or replacement parts) availability; and a change in the bill of work 18a, 18b or 18c.
In an exemplary embodiment, as illustrated in
In an exemplary embodiment, as illustrated in
In an exemplary embodiment, before prioritizing the maintenance items T11-T33 in the step 52, the maintenance items T11-T33 may be filtered by identifying those maintenance items that cannot or should not be done because of, for example, one or more of the following reasons: station constraint (including base items), ground time violation, low-yield routine maintenance items, unavailability of parts, and conflict with critical maintenance items.
In an exemplary embodiment, to verify compliance with the parking parameter 16b in the step 54, it is determined whether the line maintenance station 12 has enough space or area to accommodate the parking of the airplanes 14a, 14b and 14c at the line maintenance station 12. If not, then one or more of the airplanes 14a, 14b and 14c are directed to a different line maintenance station. The remainder the execution of the method 36 will be described with the assumption that compliance with the parking parameter 16b has been verified. In several exemplary embodiments, the step 54 includes determining the parking location of each airplane 14a, 14b and 14c. In several exemplary embodiments, the determination of the parking location of each airplane 14a, 14b and 14c is based one or more of the following factors: maintenance item hangar requirement, fleet type, workload, arrival time, departure time, and/or any combination thereof.
In an exemplary embodiment, to select the initial capacity utilization percentage in the step 56, the capacity utilization of the manhours parameter 16a is estimated. As noted above, in an exemplary embodiment, the capacity utilization of the manhours parameter 16a is the actual amount of hours of work that the line maintenance station 12 will indeed work during the time period t. This actual amount is always less than, and thus a percentage of, the manhours parameter 16a, that is, the amount of hours of work that the line maintenance station 12 has available to accomplish the work. The estimated capacity utilization of the manhours parameter 16a must be equal to or greater than the total amount of manhours required to complete all critical maintenance items on the bills of work 18a, 18b and 18c. The initial capacity utilization percentage selected in the step 56 is subject to the following constraint:
(initial capacity utilization percentage)×(manhours parameter 16a)≧total number of manhours required to complete all critical maintenance items
In an exemplary embodiment, as illustrated in
In an exemplary embodiment, as illustrated in
As shown in
Referring back to
As shown in
For example, as shown in
With continuing reference to
In an exemplary embodiment, the unique combinations of time slots are identified in the step 60db by using the server 18, the processor 24b, and/or the processor 30b to execute instructions stored in the computer readable medium 20, 24a and/or 30a, which results in the automatic identification of all unique combinations of time slots, in accordance with the foregoing, and/or an automatic output of the unique combinations in, for example, a list, as shown in
As shown in
Referring back to
As shown in
As shown in
In an exemplary embodiment, to determine feasibility in the step 60he, it is determined whether each reassignment complies with or otherwise satisfies one or more operational constraints including but not limited to, for example, one or more of the following: compliance with profile, feasible start time, feasible end time, maximum shift time per AMT, various constraints specific to the line maintenance station 12, minimization of wasted time (i.e., time periods within the plurality of time slots 64 during which maintenance work is not scheduled), minimization of transition time incurred by AMTs transitioning between the airplanes 14a, 14b and 14c and/or between the line maintenance station 12 and one or more other locations, and maximization of open time (i.e., maximizing continuous blocks of remaining time in the time slots 64). In an exemplary embodiment, the step 60he includes steps that are substantially identical to the steps 60dca, 60dcb, 60dcc, 60dcd and 60dce, which substantially identical steps are repeated for each reassignment of the maintenance items, rather than for each unique combination of time slots.
Referring back to
As shown in
In an exemplary embodiment, as shown in
In step 60p it is determined whether the next maintenance item has been scheduled as a result of the execution of the step 60o. If so, then the step 60b is repeated for the next maintenance item, followed by the steps subsequent to the step 60b, unless all maintenance items have been scheduled and the step 60 is completed. If not, then in step 60q the steps 60d, 60e, 60f, 60g, 60k, 60l, 60m and 60n are repeated as applicable, except that the steps are not repeated using a set of AMTs that is limited to all AMTs scheduled to work during the same work shift time period; instead, the steps are repeated using a set of AMTs that includes all AMTs scheduled to be located at the line maintenance station 12. In an exemplary embodiment, the set of AMTs scheduled to be located at the line maintenance station 12 includes the set of AMTs scheduled to work during the same work shift time period.
In step 60r it is determined whether the next maintenance has been scheduled as a result of the execution of step 60q. If so, then the step 60b is repeated for the next maintenance item, followed by the steps subsequent to the step 60b, unless all maintenance items have been scheduled and the step 60 is completed. If not, then in step 60s the next maintenance item is handled as an exception, if possible, but if not possible then the step 60 is completed and the step 61a (
In an exemplary embodiment, as illustrated in
In an exemplary embodiment, as noted above and illustrated in
In an exemplary embodiment, as illustrated in
In several exemplary embodiments, the module 17, the user device 24, the user device 30, and/or any combination thereof, are used to generate, store, and/or output the line maintenance station 12's optimized bill of work and/or the bill of material therefor.
In an exemplary embodiment, as illustrated in
In several exemplary embodiments, one or more of the user device 24, the user device 30 and the module 17 is, or at least includes, the node 72 and/or components thereof, and/or one or more nodes that are substantially similar to the node 72 and/or components thereof. In several exemplary embodiments, one or more of the above-described components of one or more of the node 72, the user device 24, the user device 30 and the module 17, include respective pluralities of same components.
In several exemplary embodiments, a computer system typically includes at least hardware capable of executing machine readable instructions, as well as the software for executing acts (typically machine-readable instructions) that produce a desired result. In several exemplary embodiments, a computer system may include hybrids of hardware and software, as well as computer sub-systems.
In several exemplary embodiments, hardware generally includes at least processor-capable platforms, such as client-machines (also known as personal computers or servers), and hand-held processing devices (such as smart phones, personal digital assistants (PDAs), or personal computing devices (PCDs), for example). In several exemplary embodiments, hardware may include any physical device that is capable of storing machine-readable instructions, such as memory or other data storage devices. In several exemplary embodiments, other forms of hardware include hardware sub-systems, including transfer devices such as modems, modem cards, ports, and port cards, for example.
In several exemplary embodiments, software includes any machine code stored in any memory medium, such as RAM or ROM, and machine code stored on other devices (such as floppy disks, flash memory, or a CD ROM, for example). In several exemplary embodiments, software may include source or object code. In several exemplary embodiments, software encompasses any set of instructions capable of being executed on a node such as, for example, on a client machine or server.
In several exemplary embodiments, combinations of software and hardware could also be used for providing enhanced functionality and performance for certain embodiments of the present disclosure. In an exemplary embodiment, software functions may be directly manufactured into a silicon chip. Accordingly, it should be understood that combinations of hardware and software are also included within the definition of a computer system and are thus envisioned by the present disclosure as possible equivalent structures and equivalent methods.
In several exemplary embodiments, computer readable mediums include, for example, passive data storage, such as a random access memory (RAM) as well as semi-permanent data storage such as a compact disk read only memory (CD-ROM). One or more exemplary embodiments of the present disclosure may be embodied in the RAM of a computer to transform a standard computer into a new specific computing machine. In several exemplary embodiments, data structures are defined organizations of data that may enable an embodiment of the present disclosure. In an exemplary embodiment, a data structure may provide an organization of data, or an organization of executable code.
In several exemplary embodiments, the network 26, and/or one or more portions thereof, may be designed to work on any specific architecture. In an exemplary embodiment, one or more portions of the network 26 may be executed on a single computer, local area networks, client-server networks, wide area networks, internets, hand-held and other portable and wireless devices and networks.
In several exemplary embodiments, a database may be any standard or proprietary database software, such as Oracle, Microsoft Access, SyBase, or DBase II, for example. In several exemplary embodiments, the database may have fields, records, data, and other database elements that may be associated through database specific software. In several exemplary embodiments, data may be mapped. In several exemplary embodiments, mapping is the process of associating one data entry with another data entry. In an exemplary embodiment, the data contained in the location of a character file can be mapped to a field in a second table. In several exemplary embodiments, the physical location of the database is not limiting, and the database may be distributed. In an exemplary embodiment, the database may exist remotely from the server, and run on a separate platform. In an exemplary embodiment, the database may be accessible across the Internet. In several exemplary embodiments, more than one database may be implemented.
In several exemplary embodiments, the system 10 and/or the execution of the method 36 provides a real time and event driven model, which assists workload planners in assigning the proper amount of maintenance to the line maintenance station 12, evens out workload, protects yield to a certain degree, quickly updates to reflect routing and other changes to further facilitate station workload planning, provides convenient reporting capability, provides more information to the field and MOC users, and identifies system performance and issues. In several exemplary embodiments, the system 10 and/or the execution of the method 36 automatically generate a feasible and balanced overnight bill of work for a line maintenance station, and provide an opportunity to respond to real time operational changes and improve station accountability.
In several experimental embodiments, experimental testing was conducted from April 2008 to June 2008 to determine the feasibility of the system 10 and/or the method 36, to gage user acceptance of the system 10 and/or the method 36, to obtain user feedback regarding the system 10 and/or the method 36, and to determine what changes needed to be made to the system 10 and/or the method 36. As a result of the experimental testing, inter alia, it was experimentally determined that the scheduling algorithm must be changed to assign bills-of-work more efficiently with shorter runtime, especially for relatively large maintenance stations with more manpower (headcount) capacity. As a result of this experimental determination, which, in turn, was a result of the experimental testing, only unique combinations of the time slot(s) 64 are identified in the step 60db in an exemplary embodiment, as described above. As a result of the experimental testing, inter alia, it was experimentally determined that it was necessary to assign routine maintenance checks to the first half of a work shift time period to provide a sufficient chance to fix any unexpected maintenance requirements that might be found during the routine maintenance checks. As a result of this experimental determination, which, in turn, was a result of the experimental testing, the step 60dc was added in an exemplary embodiment, as described above. As a result of the experimental testing, inter alia, it was experimentally determined that it was necessary to implement “alternative profile” approaches to reduce the chance of infeasible solutions in the event that the manpower was too tight to schedule critical maintenance items. As a result of this experimental determination, which, in turn, was a result of the experimental testing, exceptions to default maintenance task profiles were developed in the event that the default maintenance task profiles did not fit in any combination of remaining time slots, in accordance with several exemplary embodiments; and/or the step 60s was added in an exemplary embodiment, as described above. As a result of the experimental testing, inter alia, it was experimentally determined that the method must be changed to reflect field practice on how out of service (OTS) aircraft are scheduled. As a result of this experimental determination, which, in turn, was a result of the experimental testing, flexibility was added to permit assigning AMTs from one or more remote locations to work on OTS aircraft at a particular line maintenance station, and/or permit assigning overtime to an AMT (more hours to an AMT than the amount of hours in the AMT's work shift time period). As a result of the experimental testing, it was experimentally determined to identify the maintenance items that are associated with OTS aircraft, determine the number of AMTs that will work on the OTS aircraft, and then subtract the number of manhours that will work on the OTS aircraft from the manhours capacity parameter 16a.
A method has been described that includes receiving data associated with a bill of work for each vehicle in a plurality of vehicles each of which is parked at, or is expected to be parked at, a line maintenance station, each bill of work having one or more maintenance items, each maintenance item requiring an amount of manhours; detecting a trigger event; and automatically generating an optimized bill of work for the line maintenance station in response to detecting the trigger event, the optimized bill of work for the line maintenance station reflecting a scheduling of each maintenance item, the scheduling specifying at least the following for the maintenance item: a number of maintenance technicians that are expected to work on the maintenance item; and an amount of time each maintenance technician is expected to work on the maintenance item; wherein the sum of the amounts of time the maintenance technicians are expected to work on the maintenance item equals, or is greater than, the amount of manhours required by the maintenance item. In an exemplary embodiment, generating the optimized bill of work for the line maintenance station includes prioritizing the maintenance items; and aggregating the prioritized maintenance items by vehicle to thereby identify the order in which the maintenance items are to be scheduled. In an exemplary embodiment, aggregating the prioritized maintenance items by vehicle to thereby identify the order in which the maintenance items are to be scheduled includes grouping the maintenance items by vehicle; prioritizing the groups of maintenance items by the amount of manhours required to complete all of the maintenance items in each group; and if two or more groups require the same amount of manhours to complete all of the maintenance items in each group, then prioritizing the two or more groups by the amount of maintenance technicians required to complete all of the maintenance items in each group. In an exemplary embodiment, a time slot is associated with each maintenance technician and the amount of time the maintenance technician is expected to work on one maintenance item is a portion of the time slot; and wherein generating the optimized bill of work for the line maintenance station includes scheduling the initial maintenance item; and after scheduling the initial maintenance item, scheduling the next maintenance item, including determining whether the next maintenance item is the first task of the airplane associated with the next maintenance item; and if the next maintenance item is not the first task of the airplane associated with the next maintenance item, then identifying all feasible unique combinations of time slot(s) for the next maintenance item using a first set of one or more maintenance technicians, each maintenance technician in the first set being already scheduled to work on the airplane associated with the next maintenance item; and if the next maintenance item is the first task of the airplane associated with the next maintenance item, then identifying all feasible unique combinations of time slot(s) for the next maintenance item using a second set of maintenance technicians, the second set of maintenance technicians being larger in quantity than the first set of maintenance technicians. In an exemplary embodiment, identifying all feasible unique combinations of time slot(s) for the next maintenance item using either the first set or the second set of maintenance technicians includes sorting the time slot(s) associated with the maintenance technicians by feasible start time in ascending order; identifying all unique combinations of time slot(s), the number of time slot(s) in each unique combination being equal to the number of maintenance technicians required to complete the next maintenance item; and determining the feasibility of each unique combination of time slot(s). In an exemplary embodiment, each of the first and second sets of maintenance technicians has a work shift time period associated therewith; and wherein determining the feasibility of each unique combination of time slot(s) includes determining whether the next maintenance item is a routine maintenance check; if the next maintenance item is a routine maintenance check, then determining whether the unique combination of time slot(s) can occur during the first half of the corresponding work shift time period; and if the unique combination of time slot(s) cannot occur during the first half of the corresponding work shift time period, then deeming as not feasible the unique combination of time slot(s). In an exemplary embodiment, generating the optimized bill of work for the line maintenance station further includes determining if one or more feasible unique combinations of time slot(s) have been identified; and if one or more feasible unique combinations of time slot(s) have been identified, then selecting the optimum unique combination of time slot(s) by: minimizing wasted time within the time slots; minimizing transition time within the time slots; and maximizing open time within the time slots. In an exemplary embodiment, each maintenance item has an attribute associated with one of a plurality of categories of maintenance items, the plurality of categories including a category for critical maintenance items that must be completed during a work shift time period at the line maintenance and at least one category for non-critical maintenance items; and wherein the method further includes receiving data associated with a manhours capacity parameter of the line maintenance station, the manhours capacity parameter equaling the amount of manhours that are available to work on the vehicles during the work shift time period at the line maintenance station; and selecting an initial capacity utilization percentage, which is a percentage of the manhours capacity parameter; wherein the product of the initial capacity utilization percentage and the manhours capacity parameter is greater than, or equal to, the total number of manhours required to complete all critical maintenance items. In an exemplary embodiment, the method includes outputting the optimized bill of work for the line maintenance station; automatically generating a bill of material for the optimized bill of work for the line maintenance station; and automatically outputting the bill of material for the optimized bill of work for the line maintenance station. In an exemplary embodiment, the vehicles are airplanes and the maintenance technicians are aircraft maintenance technicians.
A computer readable medium has been described that includes a plurality of instructions stored therein, the plurality of instructions including instructions for receiving data associated with a bill of work for each vehicle in a plurality of vehicles each of which is parked at, or is expected to be parked at, a line maintenance station, each bill of work having one or more maintenance items, each maintenance item requiring an amount of manhours; instructions for detecting a trigger event; and instructions for automatically generating an optimized bill of work for the line maintenance station in response to detecting the trigger event, the optimized bill of work for the line maintenance station reflecting a scheduling of each maintenance item, the scheduling specifying at least the following for the maintenance item: a number of maintenance technicians that are expected to work on the maintenance item; and an amount of time each maintenance technician is expected to work on the maintenance item; wherein the sum of the amounts of time the maintenance technicians are expected to work on the maintenance item equals, or is greater than, the amount of manhours required by the maintenance item. In an exemplary embodiment, instructions for generating the optimized bill of work for the line maintenance station include instructions for prioritizing the maintenance items; and instructions for aggregating the prioritized maintenance items by vehicle to thereby identify the order in which the maintenance items are to be scheduled. In an exemplary embodiment, instructions for aggregating the prioritized maintenance items by vehicle to thereby identify the order in which the maintenance items are to be scheduled include instructions for grouping the maintenance items by vehicle; instructions for prioritizing the groups of maintenance items by the amount of manhours required to complete all of the maintenance items in each group; and instructions for if two or more groups require the same amount of manhours to complete all of the maintenance items in each group, then prioritizing the two or more groups by the amount of maintenance technicians required to complete all of the maintenance items in each group. In an exemplary embodiment, a time slot is associated with each maintenance technician and the amount of time the maintenance technician is expected to work on one maintenance item is a portion of the time slot; and wherein instructions for generating the optimized bill of work for the line maintenance station include instructions for scheduling the initial maintenance item; and instructions for after scheduling the initial maintenance item, scheduling the next maintenance item, including instructions for determining whether the next maintenance item is the first task of the airplane associated with the next maintenance item; and instructions for if the next maintenance item is not the first task of the airplane associated with the next maintenance item, then identifying all feasible unique combinations of time slot(s) for the next maintenance item using a first set of one or more maintenance technicians, each maintenance technician in the first set being already scheduled to work on the airplane associated with the next maintenance item; and instructions for if the next maintenance item is the first task of the airplane associated with the next maintenance item, then identifying all feasible unique combinations of time slot(s) for the next maintenance item using a second set of maintenance technicians, the second set of maintenance technicians being larger in quantity than the first set of maintenance technicians. In an exemplary embodiment, instructions for identifying all feasible unique combinations of time slot(s) for the next maintenance item using either the first set or the second set of maintenance technicians include instructions for sorting the time slot(s) associated with the maintenance technicians by feasible start time in ascending order; instructions for identifying all unique combinations of time slot(s), the number of time slot(s) in each unique combination being equal to the number of maintenance technicians required to complete the next maintenance item; and instructions for determining the feasibility of each unique combination of time slot(s). In an exemplary embodiment, each of the first and second sets of maintenance technicians has a work shift time period associated therewith; and wherein instructions for determining the feasibility of each unique combination of time slot(s) include instructions for determining whether the next maintenance item is a routine maintenance check; instructions for if the next maintenance item is a routine maintenance check, then determining whether the unique combination of time slot(s) can occur during the first half of the corresponding work shift time period; and instructions for if the unique combination of time slot(s) cannot occur during the first half of the corresponding work shift time period, then deeming as not feasible the unique combination of time slot(s). In an exemplary embodiment, instructions for generating the optimized bill of work for the line maintenance station further include instructions for determining if one or more feasible unique combinations of time slot(s) have been identified; and instructions for if one or more feasible unique combinations of time slot(s) have been identified, then selecting the optimum unique combination of time slot(s) by: minimizing wasted time within the time slots; minimizing transition time within the time slots; and maximizing open time within the time slots. In an exemplary embodiment, each maintenance item has an attribute associated with one of a plurality of categories of maintenance items, the plurality of categories including a category for critical maintenance items that must be completed during a work shift time period at the line maintenance and at least one category for non-critical maintenance items; and wherein the plurality of instructions further includes instructions for receiving data associated with a manhours capacity parameter of the line maintenance station, the manhours capacity parameter equaling the amount of manhours that are available to work on the vehicles during the work shift time period at the line maintenance station; and instructions for selecting an initial capacity utilization percentage, which is a percentage of the manhours capacity parameter; wherein the product of the initial capacity utilization percentage and the manhours capacity parameter is greater than, or equal to, the total number of manhours required to complete all critical maintenance items. In an exemplary embodiment, the plurality of instructions further includes instructions for outputting the optimized bill of work for the line maintenance station; instructions for automatically generating a bill of material for the optimized bill of work for the line maintenance station; and instructions for automatically outputting the bill of material for the optimized bill of work for the line maintenance station. In an exemplary embodiment, the vehicles are airplanes and the maintenance technicians are aircraft maintenance technicians.
It is understood that variations may be made in the foregoing without departing from the scope of the present disclosure. For example, instead of, or in addition to transportation transactions often conducted in the course of airline industry business, aspects of the present disclosure are applicable and/or readily adaptable to transportation transactions conducted in other industries, including rail, bus, cruise and other travel or shipping industries, rental car industries, hotels and other hospitality industries, entertainment industries, and other industries. In an exemplary embodiment, aspects of the present disclosure are readily applicable and/or readily adaptable to a shipping travel leg in which a ship travels from one port to one or more other ports. In an exemplary embodiment, aspects of the present disclosure are readily applicable and/or readily adaptable to a trucking travel leg during which a truck travels from one city to one or more other cities. In an exemplary embodiment, aspects of the present disclosure are readily applicable and/or readily adaptable to a rail travel leg during which a train travels from one city or station to one or more other cities or stations. In an exemplary embodiment, aspects of the present disclosure are applicable and/or readily adaptable to a wide variety of transportation transactions such as, for example, an airline sequence (i.e., a plurality of airline flights), a leg of an airline sequence (i.e., a single airline flight), an airline block, and/or any combination thereof.
In several exemplary embodiments, the elements and teachings of the various illustrative exemplary embodiments may be combined in whole or in part in some or all of the illustrative exemplary embodiments. In addition, one or more of the elements and teachings of the various illustrative exemplary embodiments may be omitted, at least in part, and/or combined, at least in part, with one or more of the other elements and teachings of the various illustrative embodiments.
Any spatial references such as, for example, “upper,” “lower,” “above,” “below,” “between,” “bottom,” “vertical,” “horizontal,” “angular,” “upwards,” “downwards,” “side-to-side,” “left-to-right,” “right-to-left,” “top-to-bottom,” “bottom-to-top,” “top,” “bottom,” “bottom-up,” “top-down,”etc., are for the purpose of illustration only and do not limit the specific orientation or location of the structure described above.
In several exemplary embodiments, while different steps, processes, and procedures are described as appearing as distinct acts, one or more of the steps, one or more of the processes, and/or one or more of the procedures may also be performed in different orders, simultaneously and/or sequentially. In several exemplary embodiments, the steps, processes and/or procedures may be merged into one or more steps, processes and/or procedures.
In several exemplary embodiments, one or more of the operational steps in each embodiment may be omitted. Moreover, in some instances, some features of the present disclosure may be employed without a corresponding use of the other features. Moreover, one or more of the above-described embodiments and/or variations may be combined in whole or in part with any one or more of the other above-described embodiments and/or variations.
Although several exemplary embodiments have been described in detail above, the embodiments described are exemplary only and are not limiting, and those skilled in the art will readily appreciate that many other modifications, changes and/or substitutions are possible in the exemplary embodiments without materially departing from the novel teachings and advantages of the present disclosure. Accordingly, all such modifications, changes and/or substitutions are intended to be included within the scope of this disclosure as defined in the following claims. In the claims, means-plus-function clauses are intended to cover the structures described herein as performing the recited function and not only structural equivalents, but also equivalent structures.
This application claims the benefit of the filing date of U.S. patent application No. 61/220,005, filed Jun. 24, 2009, the entire disclosure of which is incorporated herein by reference.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4101100 | Smith et al. | Jul 1978 | A |
| 4819183 | O'Brien et al. | Apr 1989 | A |
| 4843575 | Crane | Jun 1989 | A |
| 4943919 | Aslin et al. | Jul 1990 | A |
| 5216612 | Cornett et al. | Jun 1993 | A |
| 5318254 | Shaw et al. | Jun 1994 | A |
| 5369570 | Parad | Nov 1994 | A |
| 5490646 | Shaw et al. | Feb 1996 | A |
| 5931878 | Chapin, Jr. | Aug 1999 | A |
| 5953707 | Huang et al. | Sep 1999 | A |
| 5974349 | Levine | Oct 1999 | A |
| 5987474 | Sandifer | Nov 1999 | A |
| 6003808 | Nguyen et al. | Dec 1999 | A |
| 6006171 | Vines et al. | Dec 1999 | A |
| 6014633 | DeBusk et al. | Jan 2000 | A |
| 6067486 | Aragones et al. | May 2000 | A |
| 6119058 | Anderberg | Sep 2000 | A |
| 6125312 | Nguyen et al. | Sep 2000 | A |
| 6292806 | Sandifer | Sep 2001 | B1 |
| 6408258 | Richer | Jun 2002 | B1 |
| 6418361 | Sinex | Jul 2002 | B2 |
| 6442459 | Sinex | Aug 2002 | B1 |
| 6477730 | Marrero | Nov 2002 | B1 |
| 6481627 | Guerreri | Nov 2002 | B1 |
| 6505106 | Lawrence et al. | Jan 2003 | B1 |
| 6554183 | Sticha et al. | Apr 2003 | B1 |
| 6571158 | Sinex | May 2003 | B2 |
| 6580982 | Sinex | Jun 2003 | B2 |
| 6598940 | Sinex | Jul 2003 | B2 |
| 6606546 | Sinex | Aug 2003 | B2 |
| 6643570 | Bangert et al. | Nov 2003 | B2 |
| 6671593 | Sinex | Dec 2003 | B2 |
| 6684136 | Sinex | Jan 2004 | B2 |
| 6691006 | Sinex | Feb 2004 | B2 |
| 6728610 | Marshall et al. | Apr 2004 | B1 |
| 6742000 | Fantasia et al. | May 2004 | B1 |
| 6757897 | Shi et al. | Jun 2004 | B1 |
| 6795758 | Sinex | Sep 2004 | B2 |
| 6816762 | Hensey et al. | Nov 2004 | B2 |
| 6820038 | Wetzer et al. | Nov 2004 | B1 |
| 6845306 | Henry et al. | Jan 2005 | B2 |
| 6853954 | Apostolides | Feb 2005 | B2 |
| 6920366 | Luh et al. | Jul 2005 | B1 |
| 7003374 | Olin et al. | Feb 2006 | B2 |
| 7027884 | Watanabe et al. | Apr 2006 | B2 |
| 7031941 | Garrow et al. | Apr 2006 | B2 |
| 7069121 | Cummings et al. | Jun 2006 | B1 |
| 7076532 | Craik | Jul 2006 | B2 |
| 7082383 | Baust et al. | Jul 2006 | B2 |
| 7117162 | Seal et al. | Oct 2006 | B1 |
| 7124059 | Wetzer et al. | Oct 2006 | B2 |
| 7330819 | Sinex | Feb 2008 | B2 |
| 7376600 | Wadawadigi et al. | May 2008 | B1 |
| 7440906 | Wetzer et al. | Oct 2008 | B1 |
| 7457762 | Wetzer et al. | Nov 2008 | B2 |
| 7457763 | Garrow et al. | Nov 2008 | B1 |
| 7502744 | Garrow et al. | Mar 2009 | B2 |
| 7519444 | Lilly et al. | Apr 2009 | B2 |
| 7548802 | Avery et al. | Jun 2009 | B2 |
| 7551086 | Coop et al. | Jun 2009 | B2 |
| 7689329 | Avery et al. | Mar 2010 | B2 |
| 7693621 | Chamas | Apr 2010 | B1 |
| 7761200 | Avery et al. | Jul 2010 | B2 |
| 7761201 | Avery et al. | Jul 2010 | B2 |
| 7761879 | Winston et al. | Jul 2010 | B1 |
| 7778891 | Zhang et al. | Aug 2010 | B1 |
| 7904192 | Chua et al. | Mar 2011 | B2 |
| 7908052 | Howlett et al. | Mar 2011 | B2 |
| 7937280 | Leung et al. | May 2011 | B1 |
| 8036955 | Avery et al. | Oct 2011 | B2 |
| 8170900 | Young et al. | May 2012 | B2 |
| 8195535 | Nagalla et al. | Jun 2012 | B2 |
| 8266066 | Wezter et al. | Sep 2012 | B1 |
| 8340854 | Doulatshahi et al. | Dec 2012 | B2 |
| 8356244 | Vandermolen et al. | Jan 2013 | B2 |
| 8396571 | Costiner et al. | Mar 2013 | B2 |
| 8423430 | Avery et al. | Apr 2013 | B2 |
| 8478477 | Maisonneuve et al. | Jul 2013 | B2 |
| 8504396 | Quintus et al. | Aug 2013 | B2 |
| 8645148 | Small et al. | Feb 2014 | B2 |
| 8655698 | West et al. | Feb 2014 | B2 |
| 20010037229 | Jacobs et al. | Nov 2001 | A1 |
| 20020035495 | Spira et al. | Mar 2002 | A1 |
| 20020065749 | Ikeda et al. | May 2002 | A1 |
| 20020069001 | Sinex | Jun 2002 | A1 |
| 20020121288 | Marrero | Sep 2002 | A1 |
| 20020133389 | Sinex | Sep 2002 | A1 |
| 20020143601 | Sinex | Oct 2002 | A1 |
| 20030040826 | Hawman et al. | Feb 2003 | A1 |
| 20030101578 | Moriya et al. | Jun 2003 | A1 |
| 20030109973 | Hensey et al. | Jun 2003 | A1 |
| 20030149548 | Mosses et al. | Aug 2003 | A1 |
| 20030167110 | Smith et al. | Sep 2003 | A1 |
| 20030208392 | Shekar et al. | Nov 2003 | A1 |
| 20040122722 | Quintus et al. | Jun 2004 | A1 |
| 20040122723 | Quintus et al. | Jun 2004 | A1 |
| 20040138938 | Quintus et al. | Jul 2004 | A1 |
| 20050090969 | Siok et al. | Apr 2005 | A1 |
| 20050125274 | Nastacio et al. | Jun 2005 | A1 |
| 20050187739 | Baust et al. | Aug 2005 | A1 |
| 20050198803 | Moriya et al. | Sep 2005 | A1 |
| 20050216139 | Laughlin et al. | Sep 2005 | A1 |
| 20050246224 | McKanna et al. | Nov 2005 | A1 |
| 20050246275 | Nelson | Nov 2005 | A1 |
| 20050267673 | Blagg et al. | Dec 2005 | A1 |
| 20050288983 | Biegler et al. | Dec 2005 | A1 |
| 20060046718 | Gevalt | Mar 2006 | A1 |
| 20060089846 | Middlebrook | Apr 2006 | A1 |
| 20060143063 | Braun et al. | Jun 2006 | A1 |
| 20060186260 | Magnuson et al. | Aug 2006 | A1 |
| 20060294140 | Schemionek et al. | Dec 2006 | A1 |
| 20070112488 | Avery et al. | May 2007 | A1 |
| 20070112489 | Avery et al. | May 2007 | A1 |
| 20070150329 | Brook et al. | Jun 2007 | A1 |
| 20070156496 | Avery et al. | Jul 2007 | A1 |
| 20070219944 | Liu et al. | Sep 2007 | A1 |
| 20070265896 | Smith | Nov 2007 | A1 |
| 20080103843 | Goeppert et al. | May 2008 | A1 |
| 20080159158 | Poisson et al. | Jul 2008 | A1 |
| 20080243570 | Moorkanat et al. | Oct 2008 | A1 |
| 20080270150 | Verol | Oct 2008 | A1 |
| 20090105866 | Fontanot | Apr 2009 | A1 |
| 20090125357 | Vannette et al. | May 2009 | A1 |
| 20090132111 | Macchia et al. | May 2009 | A1 |
| 20090132321 | Kamisuwa et al. | May 2009 | A1 |
| 20090138423 | Nwadiogbu et al. | May 2009 | A1 |
| 20090138873 | Beck et al. | May 2009 | A1 |
| 20090150022 | McMillin et al. | Jun 2009 | A1 |
| 20090164490 | Wininger et al. | Jun 2009 | A1 |
| 20090187449 | Van Tulder et al. | Jul 2009 | A1 |
| 20090192659 | Beebe et al. | Jul 2009 | A1 |
| 20090243854 | Scheid et al. | Oct 2009 | A1 |
| 20090254403 | Nagalla et al. | Oct 2009 | A1 |
| 20090312897 | Jamrosz et al. | Dec 2009 | A1 |
| 20100010708 | Bailly et al. | Jan 2010 | A1 |
| 20100017241 | Lienhardt | Jan 2010 | A1 |
| 20100042445 | Nicosia | Feb 2010 | A1 |
| 20100100271 | Nagalla et al. | Apr 2010 | A1 |
| 20100131149 | Saugnac et al. | May 2010 | A1 |
| 20110202924 | Banguero et al. | Aug 2011 | A1 |
| Entry |
|---|
| Boeing 777, Flight Manual, Continental, Sec. Intro TOC-1, No. 9, rev (selection) Nov. 1, 2002. |
| IT strategies for aircraft configuration management, Aircraft Commerce, Issue No. 39, Feb.-Mar. 2005. |
| Marmel et all, Microsoft Office Project 2007, all-in-one desk reference for dummies, Wiley publiching, ISBM 978-0-470-13767-3, (selection) 2007. |
| NASA Systems Engineering Handbook, NASA SP 6105, rev 1, (selection) 2007. |
| NASA, Systems Engineering handbook, PPMI publishing, SP-610S, Jun. 1995. |
| Oracle Complex Maintainance, Repair and Overhaul Implementation Guide, release 11i, part No. B13737-04, Oracle, Jul. 2005. |
| Ramohalli Gautham, The Honeywell On-board diagnostic and maintenance system for the Boeing 777, IEEE, 0-7803-0820-4, 1992. |
| Sinex, specification of U.S. Appl. No. 60/168,400 leading to application 09727671, Dec. 1999. |
| Zhang et al, Reducing maintenance cost through effective prediction analysis and process integration Journal Advances in Vibration Engineering 5-2, p. 87-96, 2006. |
| Marmel Elaine, Microsoft Project 2007 Bible, Wiley Publishing, ISBN, 0-470-00992-6, (selection) 2007. |
| Alvarez-Valdes et al, Labour Scheduling at an Airport Refuelling Installation, J of Operation Research Society, V50, N3, pp. 211-218, Mar. 1999 http://www.jstor.org/stable/3010684. |
| Goplan et al, The Aircraft maintenance routing problem, Operations Research, 46, 2, p. 260, Apr. 1998. |
| Hesham Alfares K, Aircraft maintenance workforce scheduling, Journal of Quality Maintenance Eng, V5, N2, pp. 78-88, 1999 http://www.ccse.kfupm.edu.sa/˜hesham/JP6—Aircraft—Maintenance.pdf. |
| Polimac et al, Maintenance Scheduling according to reliability targets and actual equipment performance, CIRED, IEE Jun. 18-21, 2001 http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=00942940. |
| Roach et al, A Hybrid GA-SA Algorithm for Just-In-Time scheduling of multi-level assemblies, Computers ind Eng, N4, pp. 1047-1060, Elsevier S0360835296, 1996. |
| Shehory et al, Agent aided aircraft maintenance, Autonomous Agents 99, ACM 1-58113-066-x-99-05, 1999 http://dl.acm.org/citation.cfm?id=301216. |
| Sprinkle et al, Analysis and Representation of Clauses in Satisfiability of Constraints, ISIS-01-205, Vanderbuilt University, 2001 http://w3.isis.vanderbilt.edu/Projects/micants/Tech/index.html. |
| Swanson Laura, Linking maintenance strategies to performance, Int J Production Economics 70, 237-244, Elsevier 2001 http://www.sciencedirect.com/science/article/pii/S0925527300000670#. |
| vanBuskirk et al, Computer-aided Aircraft Maintenance Scheduling, ISIS-02-03, Vanderbuilt University 2002 http://w3.isis.vanderbilt.edu/Projects/micants/Tech/TR-02-303.doc. |
| Sriram et al, An optimization model for aircraft maintenance scheduling and re-assignment, Transportation Research A 37, 29-48, Elsevier, 2003 http://www.sciencedirect.com/science/article/pii/S0965856402000046#. |
| Number | Date | Country | |
|---|---|---|---|
| 61220005 | Jun 2009 | US |
