A Hierarchical Production Planning and Finite Scheduling Framework for Part Families in Flexible Job-shop (with a case study)

نویسندگان

چکیده مقاله:

Tendency to optimization in last decades has resulted in creating multi-product manufacturing systems. Production planning in such systems is difficult, because optimal production volume that is calculated must be consistent with limitation of production system. Hence, integration has been proposed to decide about these problems concurrently. Main problem in integration is how we can relate production planning in medium-term timeframe with scheduling in short-term timeframe. Our contribution creates production planning and scheduling framework in flexible job shop environment with respect to time-limit of each machine in order to produce different parts families in automotive industry. Production planning and scheduling have iterative relationship. In this strategy information flow is transformed reciprocative between production planning and scheduling for satisfying time-limit of each machine. The proposed production planning has heuristic approach and renders a procedure to determine production priority of different part families based on safety stock. Scheduling is performed with ant colony optimization and assigns machine in order of priority to different part families on each frozen horizon. Results showed that, the proposed heuristic algorithm for planning decreased parts inventory at the end of planning horizon. Also, results of proposed ant colony optimization was near the optimal solution .The framework was performed to produce sixty four different part families in flexible job-shop with fourteen different machines. Output from this approach determined volume of production batches for part families on each frozen horizon and assigned different operations to machines.

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

a hierarchical production planning and finite scheduling framework for part families in flexible job-shop (with a case study)

tendency to optimization in last decades has resulted in creating multi-product manufacturing systems. production planning in such systems is difficult, because optimal production volume that is calculated must be consistent with limitation of production system. hence, integration has been proposed to decide about these problems concurrently. main problem in integration is how we can relate pro...

متن کامل

A Simulated Annealing Algorithm for Multi Objective Flexible Job Shop Scheduling with Overlapping in Operations

In this paper, we considered solving approaches to flexible job shop problems. Makespan is not a good evaluation criterion with overlapping in operations assumption. Accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. As overlapping in operations is a practical assumption in chemical, petrochemical, and gla...

متن کامل

A New model for integrated lot sizing and scheduling in flexible job shop problem

In this paper an integrated lot-sizing and scheduling problem in a flexible job shop environment with machine-capacity-constraint is studied. The main objective is to minimize the total cost which includes the inventory costs, production costs and the costs of machine’s idle times. First, a new mixed integer programming model,with small bucket time approach,based onProportional Lot sizing and S...

متن کامل

Simultaneous production planning and scheduling in a hybrid flow shop with time periods and work shifts

Simultaneous production planning and scheduling has been identified as one of the most important factors that affect the efficient implementation of planning and scheduling operations for the production systems. In this paper, simultaneous production planning and scheduling is applied in a hybrid flow shop environment, which has numerous applications in real industrial settings. In this problem...

متن کامل

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

متن کامل

Flexible job shop scheduling under availability constraints

In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...

متن کامل

منابع من

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

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 6  شماره 12

صفحات  25- 48

تاریخ انتشار 2013-11-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023