A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times

Abstract

Multiobjective methodology for "flexible job shop" manufacturing systems production scheduling of metalmechanic sector, under a sustainability approach In the present thesis, the object of study was the productive configuration of "Flexible Job Shop" in the metal mechanics industrial sector. The configuration in question was analyzed, then, by way of theoretical fields that concern scheduling, sustainability, and multi-objective programming.Schedulling permits the estimation of makespan time in various types of manufacturing systems. Similarly, the inherent concept of sustainability has been incorporated into organizational management, so as to achieve balanced performance in the social, environmental, and economic dimensions.The application of sustainability to schedule the evaluated configuration was fundamentally oriented toward the analysis of two of its dimensions: the economic and environmental. The study of the first of these dimensions is focused on the measurement of operational efficiency, while the second concentrates on the specific examination of energy consumption in manufacturing. In accordance with the above, the following aspects were determined, as they relate to the state of "Flexible Job Shop" configuration production programming, from the sustainability perspective: the three dimensions of sustainability have not been evaluated simultaneously, diverse variables relevant to sustainability have not been analyzed from the environmental dimension, and the evaluation of the social dimension has not been explored in depth.Based upon the above, the need to minimize the multi-objective level, in each sustainability dimension, was proposed, for the following variables: on the social level, the posture or level of sound intensity, as causes of work illness or accidents, or their causes, on the environmental level, equivalent emissions of carbon dioxide in manufacturing and its support devices, water consumption, metal or chrome solution waste, and on the economic level, makespan time, total tardiness, or cost of the resource utilized.In order to resolve the multi-objective problem, three methods were designed, based on genetic algorithms. These methods applied the information taken from a primary company. Thus, it was observed that "method one" surpassed methods two and three, in terms of C-Metric indicator performance. Further, that information registered for the two references, as documented in the literature, was processed by the program that had been structured for the implementation of "method one". It was proven, by these means, that the method in question surpassed, the performance of each of the methods developed by said references, by comparison, in that concerning the C-Metric indicator.Lastly, among other things, the following future lines of research were determined, for the productive configuration examined with sustainability criteria: the design of a model that prioritizes the analysis of various uncertainty situations, considering the equilibrium perspective of the three sustainability ...

A Discrete Particle Swarm Optimization Algorithm With Adaptive Inertia Weight for Solving Multiobjective Flexible Job-shop Scheduling Problem

“…After a lot of experiments, we found that our algorithm can quickly find better solutions for cases with larger flexibility ratio (flex.) [26] which is defined as the average number of alternate machines per operation, while cases with relatively smaller flex. require more iterations and a larger initial population.…”

Genetic Algorithms with Feasible Operators for Solving Job Shop Scheduling Problem

“…The difference in the technology can be due to the factors such as different machine and different job features. An iterated greedy algorithm is proposed for addressing the large-scale unrelated parallel machines scheduling problem (Abdelmaguid, 2015). The suggested algorithm by iterating over the constructive heuristic using destruction and construction phase provides a sequence of solutions.…”

Hyper-Heuristic Coevolution of Machine Assignment and Job Sequencing Rules for Multi-Objective Dynamic Flexible Job Shop Scheduling

“…Meta-heuristics are able to perform quite well and carry more knowledge of the problem domain, such as the ant colony optimization [13], artificial bee colony [14], artificial immune system [15], evolutionary algorithms [16], particle swarm optimization [17], tabu search [18] and variable neighborhood search [19]. Even if meta-heuristics have significantly attracted a lot of attentions from researchers, they still have two disadvantages: the first is that researchers have to design a problem-specific algorithm for each practical scheduling problem.…”