A Novel MILP Model for the Production, Lot Sizing, and Scheduling of Automotive Plastic Components on Parallel Flexible Injection Machines with Setup Common Operators

نویسندگان

چکیده

In this article, a mixed integer linear program (MILP) model is proposed for the production, lot sizing, and scheduling of automotive plastic components to minimize setup, inventory, stockout, backorder costs, by taking into account injection molds as main index schedule on parallel flexible machines. The MILP considers minimum maximum inventory capacities penalizes stockout. A relevant characteristic modeled problem dependence between mold setups produce components. sizing solution results in assignment machines during specific time period calculation number be produced, which often called size, following sequence-dependent setup time. Depending machine units produced will distinct because differ from one another. stock coverage, defined demand days, also included avoid backorders, highly penalized supply chain. Added this, extended considering common operators respond fulfill constraints that appear enterprises. regard, presented solves lot-sizing problem, emerged second-tier supplier real Finally, article validates performing experiments with different sized instances, including small, medium, large. large-sized dataset characterized replicating amount data used enterprise, object study. goodness evaluated computational deviation obtained regards optimal solution.

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

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

منابع مشابه

Simultaneous Lot Sizing and Scheduling in a Flexible Flow Line

This paper breaks new ground by modelling lot sizing and scheduling in a flexible flow line (FFL) simultaneously instead of separately. This problem, called the ‘General Lot sizing and Scheduling Problem in a Flexible Flow Line’ (GLSP-FFL), optimizes the lot sizing and scheduling of multiple products at multiple stages, each stage having multiple machines in parallel. The objective is to satisf...

متن کامل

On discrete lot-sizing and scheduling on identical parallel machines

We consider the multi-item discrete lot-sizing and scheduling problem on identical parallel machines. Based on the fact that the machines are identical, we introduce aggregate integer variables instead of individual variables for each machine. For the problem with start-up costs, we show that the inequalities based on a unit flow formulation for each machine can be replaced by a single integer ...

متن کامل

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

متن کامل

Multi-product lot-sizing and scheduling on unrelated parallel machines

We study a problem of optimal scheduling and lot-sizing a number of products on m unrelated parallel machines to satisfy given demands. A sequence dependent setup time is required between lots of different products. The products are assumed to be all continuously divisible or all discrete. The criterion is to minimize the time, at which all the demands are satisfied, Cmax, or the maximum latene...

متن کامل

Flexible flowshop scheduling with equal number of unrelated parallel machines

This article addresses a multi-stage flowshop scheduling problem with equal number of unrelated parallel machines. The objective is to minimize the makespan for a given set of jobs in the system. This problem class is NP-hard in the strong sense, so a hybrid heuristic method for sequencing and then allocating operations of jobs to machines is developed. A number of test problems are randomly ge...

متن کامل

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


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

ژورنال

عنوان ژورنال: Complexity

سال: 2021

ISSN: ['1099-0526', '1076-2787']

DOI: https://doi.org/10.1155/2021/6667516