Suchergebnisse
Filter
12 Ergebnisse
Sortierung:
Eficiencia Energética y Robustez en Problemas de Scheduling
[EN] Many industrial problems can be modelled as a scheduling problem where some resources are assigned to tasks so as to minimize the completion time, to reduce the use of resources, idle time, etc. There are several scheduling problems which try to represent different kind of situations that can appear in real world problems. Job Shop Scheduling Problem (JSP) is the most used problem. In JSP there are different jobs, every job has different tasks and these tasks have to be executed by different machines. JSP can be extended to other problems in order to simulate more real problems. In this work we have used the problem job shop with operators JSO(n,p) where each task must also be assisted by one operator from a limited set of them. Additionally, we have extended the classical JSP to a job-shop scheduling problem where machines can consume different amounts of energy to process tasks at different rates (JSMS). In JSMS operation has to be executed by a machine that has the possibility to work at different speeds. Scheduling problems consider optimization indicators such as processing time, quality and cost. However, governments and companies are also interested in energy-consumption due to the rising demand and price of fuel, the reduction in energy commodity reserves and growing concern about global warming. In this thesis, we have developed new metaheuristic search techniques to model and solve the JSMS problem. Robustness is a common feature in real life problems. A system persists if it remains running and maintains his main features despite continuous perturbations, changes or incidences. We have developed a technique to solve the $JSO(n,p)$ problem with the aim of obtaining optimized and robust solutions. We have developed a dual model to relate optimality criteria with energy consumption and robustness/stability in the JSMS problem. This model is committed to protect dynamic tasks against further incidences in order to obtain robust and energy-aware solutions. The proposed dual model has been evaluated ...
BASE
A Dual Scheduling Model for Optimizing Robustness and Energy Consumption in Manufacturing Systems
[EN] Manufacturing systems involve a huge number of combinatorial problems that must be optimized in an efficient way. One of these problems is related to task scheduling problems. These problems are NP-hard, so most of the complete techniques are not able to obtain an optimal solution in an efficient way. Furthermore, most of real manufacturing problems are dynamic, so the main objective is not only to obtain an optimized solution in terms of makespan, tardiness, and so on but also to obtain a solution able to absorb minor incidences/disruptions presented in any daily process. Most of these industries are also focused on improving the energy efficiency of their industrial processes. In this article, we propose a knowledge-based model to analyse previous incidences occurred in the machines with the aim of modelling the problem to obtain robust and energy-aware solutions. The resultant model (called dual model) will protect the more dynamic and disrupted tasks by assigning buffer times. These buffers will be used to absorb incidences during execution and to reduce the machine rate to minimize energy consumption. This model is solved by a memetic algorithm which combines a genetic algorithm with a local search to obtain robust and energy-aware solutions able to absorb further disruptions. The proposed dual model has been proven to be efficient in terms of energy consumption, robustness and stability in different and well-known benchmarks. ; The author(s) disclosed receipt of the following financial support for the research, authorship, and/or publication of this article: This research has been supported by the Spanish Government under research project TIN2013-46511-C2-1 for the Spanish government and the TETRACOM EU project FP7-ICT-2013-10-No 609491. ; Escamilla Fuster, J.; Salido Gregorio, MA. (2016). A Dual Scheduling Model for Optimizing Robustness and Energy Consumption in Manufacturing Systems. Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture. 1(1):1-12. ...
BASE
Rescheduling in job-shop problems for sustainable manufacturing systems
[EN] Manufacturing industries are faced with environmental challenges, so their industrial processes must be optimized in terms of both profitability and sustainability. Since most of these processes are dynamic, the previously obtained solutions cannot be valid after disruptions. This paper focuses on recovery in dynamic job-shop scheduling problems where machines can work at different rates. Machine speed scaling is an alternative framework to the on/off control framework for production scheduling. Thus, given a disruption, the main goal is to recover the original solution by rescheduling the minimum number of tasks. To this end, a new match-up technique is developed to determine the rescheduling zone and a feasible reschedule. Then, a memetic algorithm is proposed for finding a schedule that minimizes the energy consumption within the rescheduling zone but that also maintains the makespan constraint. An extensive study is carried out to analyze the behavior of our algorithms to recover the original solution and minimize the energy reduction in different benchmarks, which are taken from the OR-Library. The energy consumption and processing time of the tasks involved in the rescheduling zone will play an important role in determining the best match-up point and the optimized rescheduling. Upon a disruption, different rescheduling solutions can be obtained, all of which comply with the requirements but that have different values of energy consumption. The results proposed in this paper may be useful for application in real industries for energy-efficient production rescheduling. ; This research has been supported by the Seventh Framework Programme under the research project TETRACOM-GA609491 and the Spanish Government under research projects TIN2013-46511-C2-1, TIN2015-65515-C4-1-R and TIN2016-80856-R. The authors wish to thank reviewers and editors for their positive comments to improve the quality of the paper. ; Salido Gregorio, MA.; Escamilla Fuster, J.; Barber Sanchís, F.; Giret Boggino, AS. (2017). ...
BASE
Energy efficiency, robustness, and makespan optimality in job-shop scheduling problems
[EN] Many real-world problems are known as planning and scheduling problems, where resources must be allocated so as to optimize overall performance objectives. The traditional scheduling models consider performance indicators such as processing time, cost, and quality as optimization objectives. However, most of them do not take into account energy consumption and robustness. We focus our attention in a job-shop scheduling problem where machines can work at different speeds. It represents an extension of the classical job-shop scheduling problem, where each operation has to be executed by one machine and this machine can work at different speeds. The main goal of the paper is focused on the analysis of three important objectives (energy efficiency, robustness, and makespan) and the relationship among them. We present some analytical formulas to estimate the ratio/relationship between these parameters. It can be observed that there exists a clear relationship between robustness and energy efficiency and a clear trade-off between robustness/energy efficiency and makespan. It represents an advance in the state of the art of production scheduling, so obtaining energy-efficient solutions also supposes obtaining robust solutions, and vice versa. ; This research has been supported by the Spanish Government under research project MICINN TIN2013-46511-C2-1-P, the European CASES project (No. 294931) supported by a Marie Curie International Research Staff Exchange Scheme Fellowship within the FP7, and the European TETRACOM project (No. 609491) supported by FP7-ICT-2013-10. This research was also supported by the National Science Foundation of China (No. 51175262) and the Jiangsu Province Science Foundation for Excellent Youths under Grant BK2012032. ; Salido Gregorio, MA.; Escamilla Fuster, J.; Barber Sanchís, F.; Giret Boggino, AS.; Tang, D.; Dai, M. (2015). Energy efficiency, robustness, and makespan optimality in job-shop scheduling problems. AI EDAM. 30(3):300-312. https://doi.org/10.1017/S0890060415000335 ; S ; 300 ...
BASE
Energy efficiency, robustness, and makespan optimality in job-shop scheduling problems
300 312 30 3 ; S ; [EN] Many real-world problems are known as planning and scheduling problems, where resources must be allocated so as to optimize overall performance objectives. The traditional scheduling models consider performance indicators such as processing time, cost, and quality as optimization objectives. However, most of them do not take into account energy consumption and robustness. We focus our attention in a job-shop scheduling problem where machines can work at different speeds. It represents an extension of the classical job-shop scheduling problem, where each operation has to be executed by one machine and this machine can work at different speeds. The main goal of the paper is focused on the analysis of three important objectives (energy efficiency, robustness, and makespan) and the relationship among them. We present some analytical formulas to estimate the ratio/relationship between these parameters. It can be observed that there exists a clear relationship between robustness and energy efficiency and a clear trade-off between robustness/energy efficiency and makespan. It represents an advance in the state of the art of production scheduling, so obtaining energy-efficient solutions also supposes obtaining robust solutions, and vice versa. This research has been supported by the Spanish Government under research project MICINN TIN2013-46511-C2-1-P, the European CASES project (No. 294931) supported by a Marie Curie International Research Staff Exchange Scheme Fellowship within the FP7, and the European TETRACOM project (No. 609491) supported by FP7-ICT-2013-10. This research was also supported by the National Science Foundation of China (No. 51175262) and the Jiangsu Province Science Foundation for Excellent Youths under Grant BK2012032. Salido Gregorio, MA.; Escamilla Fuster, J.; Barber Sanchís, F.; Giret Boggino, AS.; Tang, D.; Dai, M. (2015). Energy efficiency, robustness, and makespan optimality in job-shop scheduling problems. AI EDAM. 30(3):300-312. ...
BASE