A novel model for production optimization with stochastic rework and failure-prone job shop schedule problem via hybrid simulation – heuristic optimization

نویسندگان

چکیده

One way to increase productivity is throughputs without using more resources. In this paper, the issue of optimal sequence products in a job shop scheduling raised, which has many uncertainties such as downtime, development time, etc. key factors affect operation time number reworks. The reworks based on metallurgical parameters, their operations according defects count, and process are quite probable. innovation dealing with job-shop there particular, addition parameter increases complexity JSSP. Therefore, added mathematical model combined method via statistical method. problem been solved simulation for meeting uncertain constraints heuristics approach optimization. Implementing high-tech casting large different reduces Work Process (WIP) capital sleep, parts queues. Also, decreasing queue length bottleneck reduced lead increased agility and, above all, productions by about 3.3 percent.

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

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

منابع مشابه

Job Shop Scheduling and Heuristic Optimization

It is predicted that job shop type of manufacture will be used more than before due economical circumstances. Companies are forced to provide their customers with large variety of products in low volume production, with view of different requirements from product consumers and low stock levels. This article briefly reviews jobs shop scheduling techniques and present designing scheduling applica...

متن کامل

Stochastic Algorithms for Optimization and Application to Job-Shop-Scheduling

Combinatorial optimization problems are often used to test heuris-tics. Among heuristics, stochastic ones deserve particular consideration being generally meta-heuristics that aim at performing reasonnably well on a wide spectrum of problems. Among them, evolutionary algorithms have recently appeared. Emphasis have been put on them by researches that have shown that they are able to solve eecie...

متن کامل

Hybrid Particle Swarm Optimization with Genetic Operators and Cauchy Distribution for Flexible Job-shop Scheduling Problem

Flexible job-shop scheduling problem (FJSP) has been well known as one of the most difficult NP-hard combinatorial optimization problems. This problem FJSP is an extension of job-shop scheduling problem (JSP) which is to create a sequence of operations satisfying the precedence relationship together with assignment of time and resources for each operation. Thus, the FJSP model is closer to the ...

متن کامل

A Novel Hybrid Whale Optimization Algorithm to Solve a Production-Distribution Network Problem Considering Carbon Emissions

Nowadays, there is a great deal of attention for regulations of carbon emissions to enforce the decision-makers of production and distribution networks to redesign their systems satisfactorily. The literature has seen a rapid interest in developing novel metaheuristics to solve this problem as a complicated optimization problem. Such difficulties motivate us to address a production-distribution...

متن کامل

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


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

ژورنال

عنوان ژورنال: Scientia Iranica

سال: 2022

ISSN: ['1026-3098', '2345-3605']

DOI: https://doi.org/10.24200/sci.2022.58634.5823