Search

Production scheduling is a critical factor to enhancing productivity in manufacturing engineering and combinatorial optimization research. The complexity and dynamic nature of production systems necessitates innovative solutions. The Job Shop Flexible Programming Problem (FJSP) provides a realistic environment for production, where processing times are variable and uncertain, and multiple objectives need optimization. To solve the Multi-Objective Flexible Fuzzy Job Shop problem with partial flexibility (P-MOFfJSP), this paper proposes a hybrid metaheuristic approach that combines the Teaching–Learning-based Optimization (TLBO) algorithm with a Genetic Algorithm. The proposed algorithm of Adaptive TLBO (TLBO-A) uses two genetic operators (mutation and crossover) with an adaptive population reconfiguration strategy, ensuring solution space exploration and preventing premature convergence. We have evaluated the TLBO-A algorithm's performance on benchmark instances commonly used in programming problems with fuzzy variables. The experimental analysis indicates significant results, demonstrating that the adaptive strategy improves the search for suitable solutions. The proposed algorithm (TLBO-A) exhibits low variations (around 11%) compared to the best mono-objective heuristic for the fuzzy makespan problem, indicating its robustness. Moreover, compared with other heuristics like traditional TLBO, the variations decrease to around 1%. However, TLBO-A stands out as it aims to solve a multi-objective problem, improving the fuzzy makespan, and identifying good results on the Pareto frontier for the fuzzy average flow time, all within this low variation margin. Our contribution addresses the challenges of production scheduling in fuzzy time environments and proposes a practical hybrid metaheuristic approach. The TLBO-A algorithm shows promising results in solving the P-MOFfJSP, highlighting the potential of our proposed methodology for solving real-world production scheduling problems. [ABSTRACT FROM AUTHOR]

This paper proposes a new type of assembly line worker assignment and balancing problem (ALWABP) which considers ergonomic risks. ALWABP occurs when task times vary according to the assigned worker. Although the operation time of a task is assumed to be fixed in classical assembly lines, it depends on the operator who executes the task in ALWABP. In ALWABP literature, the primary and secondary objectives are minimizing cycle time and balancing workload among workstations smoothly, respectively. When smoothing workload, only task times are taken into consideration in the relevant literature. However, degree of difficulty of tasks is also very important. Two workers executing two different stations with the same station time are assumed to be equally loaded according to the traditional perception. In fact, even they have the same station time; their workloads are different because of the different tasks they execute, in real life assembly line configurations. In order to close this gap between the real life and the literature, this study introduces an ALWABP problem with considering ergonomic risk factors (ErgoALWABP). Due to the complex nature of the problem, optimum seeking methods are not capable of solving it. So, the proposed problem is tackled with the multiple-rule based constructive randomized search approach. Also, OCcupational Repetitive Action method is used for making ergonomic risk assessment. Performance of the proposed solution procedure is compared with the relevant literature on benchmark data. Experimental results show that ergonomic environment could be improved when ergonomic risk factors are taken into account. [ABSTRACT FROM AUTHOR]

Copyright of Visión Electrónica is the property of Fondo de Universidad Distrital Francisco Jose de Caldas and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Visión Electrónica is the property of Fondo de Universidad Distrital Francisco Jose de Caldas and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The current approach in practice to produce the flowshop schedules of precast production is the dispatching rule technique, which does not guarantee optimal schedules. Some researchers have developed models for a single production line to optimize the scheduling, in which Genetic Algorithm (GA) is used to obtain the solution. However the models cannot be used for multiple production lines. Moreover, some optimization constraints and objectives were missing in the models, such as avoiding frequent type change of precast components during production. Both issues hinder their work to be applied to real precast plants. To overcome the problem, this paper proposes a Flowshop Scheduling Model of Multiple production lines for Precast production (MP-FSM) and develops a corresponding optimization approach to facilitate optimized scheduling by using GA. The approach was validated preliminarily by comparing with traditional scheduling approaches. The results demonstrated that optimized schedules can be obtained by using the proposed approach. [ABSTRACT FROM AUTHOR]

The article is to present the application of genetic algorithm in production scheduling in a production company. In the research work the assumptions of the methodology were described and the operation of the proposed genetic algorithm was presented in details. Genetic algorithms are useful in complex large scale combinatorial optimisation tasks and in the engineering tasks with numerous limitations in the production engineering. Moreover, they are more reliable than the existing direct search algorithms. The research is focused on the effectivity improvement and on the methodology of scheduling of a manufacturing cell work. The genetic algorithm used in the work appeared to be robust and fast in finding accurate solutions. It was shown by experiment that using this method enables obtaining schedules suitable for a model. It gives a group of solutions that are at least as good as those created by the heuristic rules. [ABSTRACT FROM AUTHOR]

Process planning and scheduling are two major sub-systems in a modern manufacturing system. In traditional manufacturing system, they were regarded as the separate tasks to perform sequentially. However, considering their complementarity, integrating process planning and scheduling can further improve the performance of a manufacturing system. Meanwhile, the multiple objectives are needed to be considered during the realistic decision-making process in a manufacturing system. Based on the above requirements from the real manufacturing system, developing effective methods to deal with the multi-objective integrated process planning and scheduling (MOIPPS) problem becomes more and more important. Therefore, this research proposes a multi-objective genetic algorithm based on immune principle and external archive (MOGA-IE) to solve the MOIPPS problem. In MOGA-IE, the fast non-dominated sorting approach used in NSGA-II is utilized as the fitness assignment scheme and the immune principle is exploited to maintain the diversity of the population and prevent the premature condition. Moreover, the external archive is employed to store and maintain the Pareto solutions during the evolutionary process. Effective genetic operators are also designed for MOIPPS. To test the performance of the proposed algorithm, three different scale instances have been employed. And the proposed method is also compared with other previous algorithms in literature. The results show that the proposed algorithm has achieved good improvement and outperforms the other algorithms. [ABSTRACT FROM AUTHOR]