| 1. |
- Fotedar, Sunney, 1989, et al.
(författare)
-
A criterion space decomposition approach to generalized tri-objective tactical resource allocation
- 2023
-
Ingår i: Computational Management Science. - : Springer Science and Business Media LLC. - 1619-697X .- 1619-6988. ; 20, s. 1-28
-
Tidskriftsartikel (refereegranskat)abstract
- We present a tri-objective mixed-integer linear programming model of the tactical resource allocation problem with inventories, called the generalized tactical resource allocation problem (GTRAP). We propose a specialized criterion space decomposition strategy, in which the projected two-dimensional criterion space is partitioned and the corresponding sub-problems are solved in parallel by application of the quadrant shrinking method (QSM) (Boland in Eur J Oper Res 260(3):873–885, 2017) for identifying non-dominated points. To obtain an efficient implementation of the parallel variant of the QSM we suggest some modifications to reduce redundancies. Our approach is tailored for the GTRAP and is shown to have superior computational performance as compared to using the QSM without parallelization when applied to industrial instances.
|
|
| 2. |
- Fotedar, Sunney, 1989, et al.
(författare)
-
Mathematical optimization of the tactical allocation of machining resources for an efficient capacity utilization in aerospace component manufacturing
- 2019
-
Ingår i: Proceedings of the 10th Aerospace Technology Congress. - : Linköping University Electronic Press. - 1650-3686 .- 1650-3740. - 9789175190068 ; , s. 183-188
-
Konferensbidrag (refereegranskat)abstract
- In the aerospace industry, with low volumes and many products, there is a critical need to efficiently use available manufacturing resources. Currently, at GKN Aerospace, resource allocation decisions that in many cases will last for several years are to some extent made with a short-term focus so as to minimize machining time, which results in a too high load on the most capable machines, and too low load on the less capable ones. This creates an imbalance in capacity utilization that leads to unnecessary queuing at some machines, resulting in long lead times and in an increase in tied-up capital. Tactical resource allocation on the medium to long-range planning horizon (six months to several years) aims to address this issue by allocating resources to meet the predicted future demand as effectively as possible, in order to ensure long range profitability. Our intent is to use mathematical optimization to find the best possible allocations.
|
|
| 3. |
- Thörnblad, Karin, 1971, et al.
(författare)
-
Scheduling optimization of a real flexible job shop including fixture availability and preventive maintenance
- 2015
-
Ingår i: European Journal of Industrial Engineering. - 1751-5254. ; 9:1, s. 126-145
-
Tidskriftsartikel (refereegranskat)abstract
- The multitask cell at GKN Aerospace Sweden is a flexible job shop containing ten resources aimed at being flexible with regard to product mix and processing types. We present a time-indexed formulation of the problem of optimally scheduling the planned jobs on the resources, also considering a limited availability of fixtures as well as required preventive maintenance activities. The objective is to minimize a weighted sum of the completion times and tardiness for the jobs, where the tardiness weight for a given job is a non-increasing function of its due date. We propose a fast iterative approach to finding a suitable value of the length of the time horizon that needs to be set for the time-indexed formulation and which considerably influences the computation time. Computational results show that the method developed is able to produce optimal, or near-optimal, schedules for real data instances within an acceptable practical time frame.
|
|
| 4. |
- Thörnblad, Karin, 1971, et al.
(författare)
-
Scheduling optimization of a real flexible job shop including side constraints regarding maintenance, fixtures, and night shifts
- 2013
-
Annan publikation (övrigt vetenskapligt/konstnärligt)abstract
- We present a generic iterative scheduling procedure for the scheduling of a real flexible job shop, the so-called multitask cell at GKN Aerospace Engine Systems in Sweden. A time-indexed formulation of the problem is presented including side constraints regarding preventive maintenance, fixture availability, and unmanned night shifts. This paper continues the work in [35], with an improvement of the iterative solution procedure and the inclusion of constraints regarding night shifts during which only unmanned processing is allowed. The resulting schedules are compared with schedules constructed using two priority dispatching rules. Computational results show that the gain of including the night shifts constraints is significant and that the methodology developed is able to produce near-optimal schedules for industrial data instances for the coming shift within an acceptable practical time frame.
|
|
| 5. |
- Almgren, Torgny, 1962, et al.
(författare)
-
Optimization of opportunistic replacement activities: A case study in the aircraft industry
- 2007
-
Annan publikation (övrigt vetenskapligt/konstnärligt)abstract
- In the aircraft industry maximizing availability is essential. Maintenance schedules must therefore be opportunistic, incorporating preventive maintenance activities within the scheduled as well as the unplanned ones. At the same time, the maintenance contractor should utilize opportunistic maintenance to enable the minimization of the total expected cost to have a functional aircraft engine and thus to provide attractive service contracts. This paper provides an opportunistic maintenance optimization model which has been constructed and tested together with Volvo Aero Corporation in Trollhättan, Sweden for the maintenance of the RM12 engine. The model incorporates components with deterministic as well as with stochastic lives. The replacement model is shown to have favourable properties; in particular, when the maintenance occasions are fixed the remaining problem has the integrality property, the replacement polytope corresponding to the convex hull of feasible solutions is full-dimensional, and all the necessary constraints for its definition are facet-inducing. We present an empirical crack growth model that estimates the remaining life and also a case study that indicates that a non-stationary renewal process with Weibull distributed lives is a good model for the recurring maintenance occasions. Using one point of support for the distribution yields a deterministic replacement model; it is evaluated against classic maintenance policies from the literature through stochastic simulations. The deterministic model provides maintenance schedules over a finite time period that induce fewer maintenance occasions as well as fewer components replaced.
|
|
| 6. |
- Almgren, Torgny, 1962, et al.
(författare)
-
Optimization models for improving periodic maintenance schedules by utilizing opportunities
- 2012
-
Ingår i: Proceedings of 4th Production and Operations Management World Conference, July 2012.
-
Konferensbidrag (refereegranskat)abstract
- We present mathematical models for finding optimal opportunistic maintenance schedules for systems, in which components are assigned maximum replacement intervals. Our mod- els are applied to safety-critical components in an aircraft engine, for which maintenance opportunities naturally arise since entire modules are sent to the workshop when mainte- nance is required on one or more components. Case study results illustrate the advantage of the mathematical models over simpler policies, the benefit of coordinating the maintenance in economically dependent systems, and that our models can be utilized also for strategic investment decision support.
|
|
| 7. |
|
|
| 8. |
- Almgren, Torgny, 1962, et al.
(författare)
-
The opportunistic replacement problem: analysis and case studies
- 2011
-
Annan publikation (övrigt vetenskapligt/konstnärligt)abstract
- We consider an optimization model for determining optimal opportunistic maintenance (that is, component replacement) schedules when data is deterministic. This problem generalizes that of Dickman, Epstein, and Wilamowsky [21] and is a natural starting point for the modelling of replacement schedules when component lives are non-deterministic. We show that this basic opportunistic replacement problem is NP-hard. We show that the convex hull of the set of feasible replacement schedules is full-dimensional, and that all the necessary inequalities also are facet-inducing. We show that when maintenance occasions are fixed, the remaining problem can be stated as a linear program; when maintenance costs are monotone with time, the latter is solvable through a greedy procedure. Results from a series of case studies performed in the areas of aircraft engine and wind turbine maintenance are also reported. These illustrate the advantages of utilizing opportunistic maintenance activities based on a complete optimization model, as compared to simpler policies.
|
|
| 9. |
- Almgren, Torgny, 1962, et al.
(författare)
-
The opportunistic replacement problem: theoretical analyses and numerical tests
- 2012
-
Ingår i: Mathematical Methods of Operations Research. - : Springer Science and Business Media LLC. - 1432-2994 .- 1432-5217. ; 76:3, s. 289-319
-
Tidskriftsartikel (refereegranskat)abstract
- We consider a model for determining optimal opportunistic maintenance schedules with respect to a maximum replacement interval. This problem generalizes that of Dickman et al. (J Oper Res Soc India 28:165–175, 1991) and is a natural starting point for modelling replacement schedules of more complex systems. We show that this basic opportunistic replacement problem is NP-hard, that the convex hull of the set of feasible replacement schedules is full-dimensional, that all the inequalities of the model are facet-inducing, and present a new class of facets obtained through a {0,1/2}-Chvátal–Gomory rounding. For costs monotone with time, a class of elimination constraints is introduced to reduce the computation time; it allows maintenance only when the replacement of at least one component is necessary. For costs decreasing with time, these constraints eliminate non-optimal solutions. When maintenance occasions are fixed, the remaining problem is stated as a linear program and solved by a greedy procedure. Results from a case study on aircraft engine maintenance illustrate the advantage of the optimization model over simpler policies. We include the new class of facets in a branch-and-cut framework and note a decrease in the number of branch-and-bound nodes and simplex iterations for most instance classes with time dependent costs. For instance classes with time independent costs and few components the elimination constraints are used favorably. For fixed maintenance occasions the greedy procedure reduces the computation time as compared with linear programming techniques for all instances tested.
|
|
| 10. |
- Almgren, Torgny, 1962, et al.
(författare)
-
The replacement problem: A polyhedral and complexity analysis. The complete version
- 2009
-
Annan publikation (övrigt vetenskapligt/konstnärligt)abstract
- We consider an optimization model for determining optimal opportunistic maintenance (that is, component replacement) schedules when data is deterministic. This problem, which generalizes that of Dickman et al., is a natural starting point for the modelling of replacement schedules when component lives are non-deterministic, whence a mathematical study of the model is of large interest. We show that the convex hull of the set of feasible replacement schedules is full-dimensional, and that all the necessary inequalities are facet-inducing. Additional facets are then provided through Chvatal-Gomory rounding. We show that when maintenance occasions are fixed, the remaining problem reduces to a linear program; in some cases the latter is solvable through a greedy procedure. We further show that this basic replacement problem is NP-hard.
|
|
