Scheduling problems with the effects of deterioration and learning

Author name used in this publication: T. C. E. Cheng2006-2007 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

Single machine scheduling with general positional deterioration and rate-modifying maintenance

We present polynomial-time algorithms for single machine problems with generalized positional deterioration effects and machine maintenance. The decisions should be taken regarding possible sequences of jobs and on the number of maintenance activities to be included into a schedule in order to minimize the overall makespan. We deal with general non-decreasing functions to represent deterioration rates of job processing times. Another novel extension of existing models is our assumption that a maintenance activity does not necessarily fully restore the machine to its original perfect state. In the resulting schedules, the jobs are split into groups, a particular group to be sequenced after a particular maintenance period, and the actual processing time of a job is affected by the group that job is placed into and its position within the group

Turbofan Engine Behaviour Forecasting using Flight Data and Machine Learning Methods

The modern gas turbine engine widely used for aircraft propulsion is a complex integrated system which undergoes deterioration during operation due to the degradation of its gas path components. This dissertation outlines the importance of Engine Condition Monitoring (ECM) for a more efficient maintenance planning. Different ML approaches are compared with the application of predicting engine behaviour aiming at finding the optimal time for engine removal. The selected models were OLS, ARIMA, NeuralProphet, and Cond-LSTM. Long operating and maintenance history of two mature CF6-80C2 turbofan engines were used for the analysis, which allowed for the identification of the impact of different factors on engine performance. These factors were also considered when training the ML models, which resulted in models capable of performing prediction under specified operation and flight conditions. The Machine Learning (ML) models provided forecasting of the Exhaust Gas Temperature (EGT) parameter at take-off phase. Cond-LSTM is shown to be a reliable tool for forecasting engine EGT with a Mean Absolute Error (MAE) of 7.64?, allowing for gradual performance deterioration under specific operation type. In addition, forecasting engine performance parameters has shown to be useful for identifying the optimal time for performing important maintenance action, such as engine gas path cleaning. This thesis has shown that engine removal forecast can be more precise by using sophisticated trend monitoring and advanced ML methods.O moderno motor de turbina a gás amplamente utilizado para propulsão de aeronaves é um sistema integrado complexo que sofre deterioração durante a operação devido à degradação de seus componentes do percurso do gás. Esta dissertação destaca a importância da monitorização da condição do motor para um planejamento de manutenção mais eficiente. Diferentes abordagens de Machine Learning (ML) são comparadas visando a aplicação de previsão do comportamento do motor com o objetivo de encontrar o momento ideal para a remoção do motor. Os modelos selecionados foram OLS, ARIMA, NeuralProphet e Cond-LSTM. O longo histórico de operação e manutenção de dois motores turbofan CF6-80C2 maduros foi usado para a análise, o que permitiu a identificação do impacto de diferentes fatores no desempenho do motor. Esses fatores também foram considerados no treinamento dos modelos de ML, o que resultou em modelos capazes de realizar a previsão em operação e condições de voo especificadas. Os modelos ML forneceram previsão do parâmetro Exhaust Gas Temperature (EGT) na fase de decolagem. O Cond-LSTM demonstrou ser uma ferramenta confiável para previsão do EGT do motor com um erro absoluto médio de 7,64 ?, permitindo a deterioração gradual do desempenho sob um tipo específico de operação. Além disso, a previsão dos parâmetros de desempenho do motor tem se mostrado útil para identificar o momento ideal para realizar ações de manutenção importantes, como a limpeza do percurso do gás do motor. Esta tese mostrou que a previsão de remoção do motor pode ser mais precisa usando um monitoramento sofisticado de tendências e métodos avançados de ML

An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects

[EN] This paper addresses a sequence dependent setup times no-wait flowshop with learning and forgetting effects to minimize total flowtime. This problem is NP-hard and has never been considered before. A position-based learning and forgetting effects model is constructed. Processing times of operations change with the positions of corresponding jobs in a schedule. Objective increment properties are deduced and based on them three accelerated neighbourhood construction heuristics are presented. Because of the simplicity and excellent performance shown in flowshop scheduling problems, an iterated greedy heuristic is proposed. The proposed iterated greedy algorithm is compared with some existing algorithms for related problems on benchmark instances. Comprehensive computational and statistical tests show that the presented method obtains the best performance among the compared methods. (C) 2018 Elsevier Inc. All rights reserved.This work is supported by the National Natural Science Foundation of China (Nos. 61572127, 61272377), the Collaborative Innovation Center of Wireless Communications Technology and the Key Natural Science Fund for Colleges and Universities in Jiangsu Province (No. 12KJA630001). Ruben Ruiz is partially supported by the Spanish Ministry of Economy and Competitiveness(MINECO), under the project "SCHEYARD - Optimization of Scheduling Problems in Container Yards" with reference DPI2015-65895-R.Li, X.; Yang, Z.; Ruiz García, R.; Chen, T.; Sui, S. (2018). An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects. Information Sciences. 453:408-425. https://doi.org/10.1016/j.ins.2018.04.038S40842545

Combining time and position dependent effects on a single machine subject to rate-modifying activities

We introduce a general model for single machine scheduling problems, in which the actual processing times of jobs are subject to a combination of positional and time-dependent effects, that are job-independent but additionally depend on certain activities that modify the processing rate of the machine, such as, maintenance. We focus on minimizing two classical objectives: the makespan and the sum of the completion times. The traditional classification accepted in this area of scheduling is based on the distinction between the learning and deterioration effects on one hand, and between the positional effects and the start-time dependent effects on the other hand. Our results show that in the framework of the introduced model such a classification is not necessary, as long as the effects are job-independent. The model introduced in this paper covers most of the previously known models. The solution algorithms are developed within the same general framework and their running times are no worse than those available earlier for problems with less general effects

Parallel-Machine Scheduling Problems with Past-Sequence-Dependent Delivery Times and Aging Maintenance

We consider parallel-machine scheduling problems with past-sequence-dependent (psd) delivery times and aging maintenance. The delivery time is proportional to the waiting time in the system. Each machine has an aging maintenance activity. We develop polynomial algorithms to three versions of the problem to minimize the total absolute deviation of job completion times, the total load, and the total completion time

AI and OR in management of operations: history and trends

The last decade has seen a considerable growth in the use of Artificial Intelligence (AI) for operations management with the aim of finding solutions to problems that are increasing in complexity and scale. This paper begins by setting the context for the survey through a historical perspective of OR and AI. An extensive survey of applications of AI techniques for operations management, covering a total of over 1200 papers published from 1995 to 2004 is then presented. The survey utilizes Elsevier's ScienceDirect database as a source. Hence, the survey may not cover all the relevant journals but includes a sufficiently wide range of publications to make it representative of the research in the field. The papers are categorized into four areas of operations management: (a) design, (b) scheduling, (c) process planning and control and (d) quality, maintenance and fault diagnosis. Each of the four areas is categorized in terms of the AI techniques used: genetic algorithms, case-based reasoning, knowledge-based systems, fuzzy logic and hybrid techniques. The trends over the last decade are identified, discussed with respect to expected trends and directions for future work suggested