14,235 research outputs found
Computational intelligence approaches to robotics, automation, and control [Volume guest editors]
No abstract available
Multi-Objective Flexible Job Shop Scheduling Using Genetic Algorithms
Flexible Job Shop Scheduling is an important problem in the fields of combinatorial optimization and production management. This research addresses multi-objective flexible job shop scheduling problem with the objective of simultaneous minimization of: (1) makespan, (2) workload of the most loaded machine, and (3) total workload. A general-purpose, domain independent genetic algorithm implemented in a spreadsheet environment is proposed for the flexible job shop. Spreadsheet functions are used to develop the shop model. Performance of the proposed algorithm is compared with heuristic algorithms already reported in the literature. Simulation experiments demonstrated that the proposed methodology can achieve solutions that are comparable to previous approaches in terms of solution quality and computational time. Flexible job shop models presented herein are easily customizable to cater for different objective functions without changing the basic genetic algorithm routine or the spreadsheet model. Experimental analysis demonstrates the robustness, simplicity, and general-purpose nature of the proposed approach
A Fuzzy Simheuristic for the Permutation Flow Shop Problem under Stochastic and Fuzzy Uncertainty
[EN] Stochastic, as well as fuzzy uncertainty, can be found in most real-world systems. Considering both types of uncertainties simultaneously makes optimization problems incredibly challenging. In this paper, we analyze the permutation flow shop problem (PFSP) with both stochastic and fuzzy processing times. The main goal is to find the solution (permutation of jobs) that minimizes the expected makespan. However, due to the existence of uncertainty, other characteristics of the solution are also taken into account. In particular, we illustrate how survival analysis can be employed to enrich the probabilistic information given to decision-makers. To solve the aforementioned optimization problem, we extend the concept of a simheuristic framework so it can also include fuzzy elements. Hence, both stochastic and fuzzy uncertainty are simultaneously incorporated in the PFSP. In order to test our approach, classical PFSP instances have been adapted and extended, so that processing times become either stochastic or fuzzy. The experimental results show the effectiveness of the proposed approach when compared with more traditional ones.This work has been partially supported by the Spanish Ministry of Science (PID2019111100RB-C21/AEI/10.13039/501100011033), as well as by the Barcelona Council and the "la Caixa" Foundation under the framework of the Barcelona Science Plan 2020-2023 (grant 21S09355-001).Castaneda, J.; Martín, XA.; Ammouriova, M.; Panadero, J.; Juan-Pérez, ÁA. (2022). A Fuzzy Simheuristic for the Permutation Flow Shop Problem under Stochastic and Fuzzy Uncertainty. Mathematics. 10(10):1-17. https://doi.org/10.3390/math10101760117101
A Comparative Representation Approach to Modern Heuristic Search Methods in a Job Shop
The job shop problem is among the class of NP- hard combinatorial problems. This Research paper addresses the problem of static job shop scheduling on the job-based representation and the rule based representations. The popular search techniques like the genetic algorithm and simulated annealing are used for the determination of the objectives like minimizations of the makespan time and mean flow time. Various rules like the SPT, LPT, MWKR, and LWKR are used for the objective function to attain the results. The summary of results from this paper gives a conclusion that the genetic algorithm gives better results in the makespan time determination on both the job based representation and the rule based representation and the simulated annealing algorithm gives the better results in the mean flow time in both the representations
An Exploratory Study of Patient Falls
Debate continues between the contribution of education level and clinical expertise in the nursing practice environment. Research suggests a link between Baccalaureate of Science in Nursing (BSN) nurses and positive patient outcomes such as lower mortality, decreased falls, and fewer medication errors. Purpose: To examine if there a negative correlation between patient falls and the level of nurse education at an urban hospital located in Midwest Illinois during the years 2010-2014? Methods: A retrospective crosssectional cohort analysis was conducted using data from the National Database of Nursing Quality Indicators (NDNQI) from the years 2010-2014. Sample: Inpatients aged ≥ 18 years who experienced a unintentional sudden descent, with or without injury that resulted in the patient striking the floor or object and occurred on inpatient nursing units. Results: The regression model was constructed with annual patient falls as the dependent variable and formal education and a log transformed variable for percentage of certified nurses as the independent variables. The model overall is a good fit, F (2,22) = 9.014, p = .001, adj. R2 = .40. Conclusion: Annual patient falls will decrease by increasing the number of nurses with baccalaureate degrees and/or certifications from a professional nursing board-governing body
SLO-aware Colocation of Data Center Tasks Based on Instantaneous Processor Requirements
In a cloud data center, a single physical machine simultaneously executes
dozens of highly heterogeneous tasks. Such colocation results in more efficient
utilization of machines, but, when tasks' requirements exceed available
resources, some of the tasks might be throttled down or preempted. We analyze
version 2.1 of the Google cluster trace that shows short-term (1 second) task
CPU usage. Contrary to the assumptions taken by many theoretical studies, we
demonstrate that the empirical distributions do not follow any single
distribution. However, high percentiles of the total processor usage (summed
over at least 10 tasks) can be reasonably estimated by the Gaussian
distribution. We use this result for a probabilistic fit test, called the
Gaussian Percentile Approximation (GPA), for standard bin-packing algorithms.
To check whether a new task will fit into a machine, GPA checks whether the
resulting distribution's percentile corresponding to the requested service
level objective, SLO is still below the machine's capacity. In our simulation
experiments, GPA resulted in colocations exceeding the machines' capacity with
a frequency similar to the requested SLO.Comment: Author's version of a paper published in ACM SoCC'1
Simulation-supported framework for job shop scheduling with genetic algorithm
The Job Shop Scheduling Problem (JSSP) is recognized to be one of the most difficult scheduling problems, being NP-complete. During years, many different solving techniques were developed: some techniques are focused on the development of optimization algorithms, whilst others are based on simulation models. Since the 80s, it was recognized that a combination of the two could be of big advantage, matching advantages from both sides. However, this research stream has not been followed to a great extent. The goal of this study is to propose a novel scheduling tool able to match these two really different techniques in one common framework in order to fill this gap in literature. The base of the framework is composed by a genetic algorithm (GA) and a simulation model is introduced into the evaluation of the fitness function, due to the inability of GAs in taking into account the real performances of a production system. An additional purpose of this research is to improve the collaboration between academic and industrial worlds on the topic, through an application of the novel scheduling framework to an industrial case. The implementation to the industrial case also suggested an improvement of the tool: The introduction of the stochasticity into the proposed scheduling framework in order to consider the variable nature of the production systems
- …