A dynamic job-shop scheduling model based on deep learning

نویسندگان

چکیده

Ideally, the solution to job-shop scheduling problem (JSP) should effectively reduce cost of manpower and materials, thereby enhancing core competitiveness manufacturer. Deep learning (DL) neural networks have certain advantages in handling complex dynamic JSPs with a massive amount historical data. Therefore, this paper proposes model based on DL. Firstly, data prediction was established for scheduling, long short-term memory network (LSTM) as basis; Dropout technology adaptive moment estimation (ADAM) were introduced enhance generalization ability effect model. Next, JSP described details, three objective functions, namely, maximum makespan, total device load, key chosen optimization. Finally, multi-objective solved by improved genetic algorithm (MOGA). The effectiveness proved experimentally.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning-based Scheduling in a Job Shop

A common way of dynamically scheduling jobs in a manufacturing system is by means of dispatching rules. The problem of this method is that the performance of these rules depends on the state the system is in at each moment, and no one rule exists that overrules the rest in all the possible states that the system may be in. The system’s state is defined by a set of control attributes. It would t...

متن کامل

Solving 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...

متن کامل

Dynamic job-shop scheduling using reinforcement learning agents

Static and dynamic scheduling methods have attracted a lot of attention in recent years. Among these, dynamic scheduling techniques handle scheduling problems where the scheduler does not possess detailed information about the jobs, which may arrive at the shop at any time. In this paper, an intelligent agent based dynamic scheduling system is proposed. It consists of two independent components...

متن کامل

Job-shop scheduling in a body shop

We study a generalized job-shop problem called the body shop scheduling problem (BSSP). This problem arises from the industrial application of welding in a car body production line, where possible collisions between industrial robots have to be taken into account. BSSP corresponds to a job-shop problem where the operations of a job have to follow alternating routes on the machines, certain oper...

متن کامل

Operation Scheduling of MGs Based on Deep Reinforcement Learning Algorithm

: In this paper, the operation scheduling of Microgrids (MGs), including Distributed Energy Resources (DERs) and Energy Storage Systems (ESSs), is proposed using a Deep Reinforcement Learning (DRL) based approach. Due to the dynamic characteristic of the problem, it firstly is formulated as a Markov Decision Process (MDP). Next, Deep Deterministic Policy Gradient (DDPG) algorithm is presented t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Production Engineering & Management

سال: 2021

ISSN: ['1855-6531', '1854-6250']

DOI: https://doi.org/10.14743/apem2021.1.382