An Efficient Approach for Bottleneck Resource(s) Detection Problem in the Multi-objective Dynamic Job Shop Environments
Authors
Abstract:
Nowadays energy saving is one of the crucial aspects in decisions. One of the approaches in this case is efficient use of resources in the industrial systems. Studies in real manufacturing systems indicating that one or more machines may also act as the Bottleneck Resource/ Resources (BR). On the other hand according to the Theory of Constraints (TOC), the efficient use of resources in manufacturing systems is limited by the capacity of the BR(s). Hence, in order to improveing such systems performance, the BR(s) should be identified and assessed and improved the using capacity of such resources to the greatest extent possible. Studies indicating that Bottleneck Resource Detection (BRD) problem in the “Multi-Objective and the Dynamic conditions” of job-shop is an important issue which has not been studied in the previous literature due to its computational complexity. Hence the development of an efficient approach to identify and assess BRs in Multi-objective Dynamic Job Shop (MODJS) has been considered as the subject of this paper. In this article, a BRD method based on the Taguchi method for MODJS (TM-MODJS) has been developed. The mentioned method takes the objectives of the MODJS as estimated indices and carries out typical and finite number of experiments by combining different suitable dispatching rules to detect BR(s) which have the greatest effect on the estimated index. Comparing the results indicates effectiveness of the developed method especially in scheduling results in a reasonable time.
similar resources
An algorithm for multi-objective job shop scheduling problem
Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...
full textan algorithm for multi-objective job shop scheduling problem
scheduling for job shop is very important in both fields of production management and combinatorial op-timization. however, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. the combination of several optimization criteria induces additional complexity and new problems. in this paper, we pro...
full textSolving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm
The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...
full textSolving Flexible Job Shop Scheduling with Multi Objective Approach
In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...
full textAn object-oriented approach for multi-objective flexible job-shop scheduling problem
Flexible manufacturing systems are very complex to control and it is difficult to generate controlling systems for this problem domain. Flexible job-shop scheduling problem (FJSP) is one of the instances in this domain. It is a problemwhich inherits the job-shop scheduling problem (JSP) characteristics. FJSP has additional routing sub-problem in addition to JSP. In routing sub-problem each oper...
full textA Cross Entropy-Genetic Algorithm Approach for Multi Objective Job Shop Scheduling Problem
Multi Objective Job Shop Scheduling Problem (MOJSP) is a problem for finding optimal operation sequences of some jobs according to more than one goal to achieve. The problem gets harder as its complexity increases. The development of optimization method has led many new methods to solve this problem. This paper offers Cross Entropy-Genetic Algorithm (CEGA) method to solve job shop scheduling pr...
full textMy Resources
Journal title
volume 29 issue 12
pages 1691- 1703
publication date 2016-12-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023