A Decision Support System for Ship Maintenance Capacity Planning

In this paper, the basic framework and algorithms of a decision support system are discussed, which enhance process and capacity planning at a large repair shop. The research is strongly motivated by experiences in a project carried out at a dockyard, which performs repair, overhaul and modification programs for various classes of navy ships. We outline the basic requirements placed upon order acceptance, process planning and capacity scheduling for large maintenance projects. In subsequent sections a number of procedures and algorithms to deal with these requirements, in particular a procedure for workload-based capacity planning, a database system to support process planning are developed, as well as a resource-constrained project scheduling system to support work planning at a more detailed level. The system has been designed to support decision making at the Navy Dockyard in particular, however, we believe that, due to its generic structure, it is applicable to a wide range of project-based manufacturing and maintenance environments

Optimising airline maintenance scheduling decisions

Airline maintenance scheduling (AMS) studies how plans or schedules are constructed to ensure that a fleet is efficiently maintained and that airline operational demands are met. Additionally, such schedules must take into consideration the different regulations airlines are subject to, while minimising maintenance costs. In this thesis, we study different formulations, solution methods, and modelling considerations, for the AMS and related problems to propose two main contributions. First, we present a new type of multi-objective mixed integer linear programming formulation which challenges traditional time discretisation. Employing the concept of time intervals, we efficiently model the airline maintenance scheduling problem with tail assignment considerations. With a focus on workshop resource allocation and individual aircraft flight operations, and the use of a custom iterative algorithm, we solve large and long-term real-world instances (16000 flights, 529 aircraft, 8 maintenance workshops) in reasonable computational time. Moreover, we provide evidence to suggest, that our framework provides near-optimal solutions, and that inter-airline cooperation is beneficial for workshops. Second, we propose a new hybrid solution procedure to solve the aircraft recovery problem. Here, we study how to re-schedule flights and re-assign aircraft to these, to resume airline operations after an unforeseen disruption. We do so while taking operational restrictions into account. Specifically, restrictions on aircraft, maintenance, crew duty, and passenger delay are accounted for. The flexibility of the approach allows for further operational restrictions to be easily introduced. The hybrid solution procedure involves the combination of column generation with learning-based hyperheuristics. The latter, adaptively selects exact or metaheuristic algorithms to generate columns. The five different algorithms implemented, two of which we developed, were collected and released as a Python package (Torres Sanchez, 2020). Findings suggest that the framework produces fast and insightful recovery solutions

Unified Concept of Bottleneck

The term `bottleneck` has been extensively used in operations management literature. Management paradigms like the Theory of Constraints focus on the identification and exploitation of bottlenecks. Yet, we show that the term has not been rigorously defined. We provide a classification of bottleneck definitions available in literature and discuss several myths associated with the concept of bottleneck. The apparent diversity of definitions raises the question whether it is possible to have a single bottleneck definition which has as much applicability in high variety job shops as in mass production environments. The key to the formulation of an unified concept of bottleneck lies in relating the concept of bottleneck to the concept of shadow price of resources. We propose an universally applicable bottleneck definition based on the concept of average shadow price. We discuss the procedure for determination of bottleneck values for diverse production environments. The Law of Diminishing Returns is shown to be a sufficient but not necessary condition for the equivalence of the average and the marginal shadow price. The equivalence of these two prices is proved for several environments. Bottleneck identification is the first step in resource acquisition decisions faced by managers. The definition of bottleneck presented in the paper has the potential to not only reduce ambiguity regarding the meaning of the term but also open a new window to the formulation and analysis of a rich set of problems faced by managers.

A heuristic procedure to solve the project staffing problem with discrete time/resource trade-offs and personnel scheduling constraints

Highlights • Project staffing with discrete time/resource trade-offs and calendar constraints. • An iterated local search procedure is proposed. • Different problem decomposition techniques are applied. Abstract When scheduling projects under resource constraints, assumptions are typically made with respect to the resource availability and activities are planned each with its own duration and resource requirements. In resource scheduling, important assumptions are made with respect to the staffing requirements. Both problems are typically solved in a sequential manner leading to a suboptimal outcome. We integrate these two interrelated scheduling problems to determine the optimal personnel budget that minimises the overall cost. Integrating these problems increases the scheduling flexibility, which improves the overall performance. In addition, we consider some resource demand flexibility in this research as an activity can be performed in multiple modes. In this paper, we present an iterated local search procedure for the integrated multi-mode project scheduling and personnel staffing problem. Detailed computational experiments are presented to evaluate different decomposition heuristics and comparison is made with alternative optimisation techniques

Project Scheduling to Maximize Positive Impacts of Reconstruction Operations

Since the decline of the Cold War, the risk of major conflict between powerful industrialized nations has significantly decreased. Insecurity in the twenty-first century is forecast to arise rather from the debris of imploding states. Such situations may require intervention | military or otherwise | by concerned states, and the frequency with which these interventions occur is increasing. To meet this new operational challenge, the US military must adapt its planning procedures to account for Security, Stabilization, Transition, and Reconstruction Operations (SSTRO). This research develops a project scheduling based framework for post-conflict reconstruction that prioritizes and schedules reconstruction activities in such a way as to maximize the positive impacts during the initial phase of SSTRO. Specifically, this research proposes to build on the Multimode Resource Constrained Project Scheduling Problem with Generalized Precedence Relations (MM-RCPSP-GPR) using goal programming to maximize the reconstruction operations\u27 positive impact to the local population. This MM-RCPSP-GPR variant is applied to a notional example to illustrate its potential use in post-conflict SSTRO

Optimization Models for Multiple Resource Planning

Multiple resource planning is a very crucial undertaking for most organizations. Apart from reducing operational complexity, multiple resource planning facilitates efficient allocation of resources which reduces costs by minimizing the cost of tardiness and the cost for additional capacity. The current research investigates multiple resource loading problems (MRLP). MRLPs are very prevalent in today's organizational environments and are particularly critical for organizations that handle concurrent, time-intensive, and multiple-resource projects. Using data obtained from the Ministry of Administrative Development, Labor and Social Affairs (ADLSA), an MRLP is proposed. The problem utilizes data regarding staff, time, equipment, and finance to ensure efficient resource allocation among competing projects. In particular, the thesis proposes a novel model and solution approach for the MRLP. Computational experiments are then performed on the model. The results show that the model performs well, even in higher instances. The positive results attest to the effectiveness of the proposed MRLP proble

A Decision Support System for Dynamic Integrated Project Scheduling and Equipment Operation Planning

Common practice in scheduling under limited resource availability is to first schedule activities with the assumption of unlimited resources, and then assign required resources to activities until available resources are exhausted. The process of matching a feasible resource plan with a feasible schedule is called resource allocation. Then, to avoid sharp fluctuations in the resource profile, further adjustments are applied to both schedule and resource allocation plan within the limits of feasibility constraints. This process is referred to as resource leveling in the literature. Combination of these three stages constitutes the standard approach of top-down scheduling. In contrast, when scarce and/or expensive resource is to be scheduled, first a feasible and economical resource usage plan is established and then activities are scheduled accordingly. This practice is referred to as bottom-up scheduling in the literature. Several algorithms are developed and implemented in various commercial scheduling software packages to schedule based on either of these approaches. However, in reality resource loaded scheduling problems are somewhere in between these two ends of the spectrum. Additionally, application of either of these conventional approaches results in just a feasible resource loaded schedule which is not necessarily the cost optimal solution. In order to find the cost optimal solution, activity scheduling and resource allocation problems should be considered jointly. In other words, these two individual problems should be formulated and solved as an integrated optimization problem. In this research, a novel integrated optimization model is proposed for solving the resource loaded scheduling problems with concentration on construction heavy equipment being the targeted resource type. Assumptions regarding this particular type of resource along with other practical assumptions are provided for the model through inputs and constraints. The objective function is to minimize the fraction of the execution cost of resource loaded schedule which varies based on the selected solution and thus, considered to be the model's decision making criterion. This fraction of cost which hereafter is referred to as operation cost, encompasses four components namely schedule delay cost, shipping, rental and ownership costs for equipment

Exact and heuristic reactive planning procedures for multi-mode resource-constrained projects.

The multi-mode resource-constrained project scheduling problem (MRCPSP) involves the determination of a baseline schedule of the project activities, which can be executed in multiple modes, satisfying the precedence relations and resource constraints while minimizing the project duration. During the execution of the project, the baseline schedule may become infeasible due to activity duration and resource disruptions. We propose and evaluate a number of dedicated exact reactive scheduling procedures as well as a tabu search heuristic for repairing a disrupted schedule. We report on promising computational results obtained on a set of benchmark problems.Project scheduling; Uncertainty; Reactive scheduling; Multi-mode RCPSP;