Solving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm

author

Abstract:

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, avoiding premature convergence, and robustness of solutions is still among the challenging arguments and in the researchers’ center of attention.  The investigations in real manufacturing environments indicate that many of these systems have Bottleneck Recourses (BR). According to the concepts of the Theory of Constraint (TOC), the output of manufacturing systems is limited based on BR capacity. Hence, for improving system performance, one must find and investigate the improvement of BR effects in different levels of decision-making. Moreover, the capacity of these resources should be improved to the maximum possible limit. In this study, for detecting and using BR in shop floor decisions (e.g. scheduling), a new detection method of bottleneck for DJS problems known as bottleneck detection method based on Taguchi Approach (TA-DJS) has been developed.  On the other hand, the adapting of GA operators in amount and range of coverage can operate as an efficient approach in improving its operation and effectiveness. In this way, the adapting for operators prevents its premature convergence and the adapting in the range of coverage causes maximum use of the problem’s important resources and better performance of the algorithm in each step of its run. In the proposed GA (GAIA), initially the adapting in the amount of algorithm’s operators based on the solutions’ tangent rate for premature convergence is done, then the adapting in the range of coverage of operators’ algorithm, in first step, happens by operators convergence on BR (which was detected initially) and, in the next step, occurs by operators convergence on the elite solutions so that the search process focuses on more probable ranges than the whole range of solution. Comparing the problem results in the static state with the results of other available methods in the literature indicated high efficiency of the proposed method.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Solving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm

In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...

full text

Solving the Job Shop Scheduling Problem Using Parallel Genetic Algorithms

Extended Abstract The purpose of this paper is to present a thorough empirical analysis regarding the robustness, effectiveness and efficiency of four distinct genetic algorithm templates on the well known Job Shop Scheduling Problem (JSSP). Its popularity has maintained this combinatorial problem in the academic foray for the past five decades attracting researchers from the fields of combinat...

full text

A Genetic Algorithm Approach to Dynamic Job Shop Scheduling Problem

This paper describes a genetic algorithm approach to the dynamic job shop scheduling problem with jobs arriving continually. Both deterministic and stochastic models of the dynamic problem were investigated. The objective functions examined were weighted flow time, maximum tardiness, weighted tardiness, weighted lateness, weighted number of tardy jobs, and weighted earliness plus weighted tardi...

full text

Solving the Job Shop Scheduling Problem with a Parallel and Agent-based Local Search Genetic Algorithm

Job shop scheduling problems play an important role in both manufacturing systems and industrial process for improving the utilization of resources, and therefore it is crucial to develop efficient scheduling technologies. The Job shop scheduling problem, one of the best known production scheduling problems, has been proved to be NP-hard. In this paper, we present a parallel and agent-based loc...

full text

A Job-shop Scheduling Problem (jssp) Using Genetic Algorithm (ga)

The job-shop scheduling (JSS) is a schedule planning for low volume systems with many variations in requirements. In job-shop scheduling problem (JSSP) environment, there are j jobs to be processed on m machines with a certain objective function to be minimized. JSSP with j jobs to be processed on more than two machines have been classified as a combinatorial problem. They cannot be formulated ...

full text

solving flexible job-shop scheduling problem using hybrid algorithm based on gravitational search algorithm and particle swarm optimization

job shop scheduling problem has significant importance in many researchingfields such as production management and programming and also combinedoptimizing. job shop scheduling problem includes two sub-problems: machineassignment and sequence operation performing. in this paper combination ofparticle swarm optimization algorithm (pso) and gravitational search algorithm(gsa) have been presented f...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 29  issue 3

pages  347- 358

publication date 2016-03-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