Nonlinear Blend Scheduling via Inventory Pinch-based Algorithm using Discrete- and Continuous-time Models

نویسنده

  • V. Mahalec
چکیده

Mathematical optimization has become an important supply chain management tool for any contemporary enterprise. Increasing profit margins through better design, planning, and operative decisions across the supply chain represents a huge opportunity in the more than ever competitive economic market, especially in a global scale. Industrial and academic researchers have been working intensively in the process systems engineering area, and several advancements have been made in the optimization field, from new mathematical models, more efficient solution algorithms, use of more powerful computing machines and with parallel capabilities, and the development of different optimization frameworks. A supply chain is composed of the following elements: procurement and storage of raw materials, facilities and processes to transform the raw materials into intermediate and final products, storage of these products and its distribution to warehouses or to the final customers. Operating the complete supply chain structure in the best possible manner (i.e. maximizing profit or minimizing cost) involves making decisions at different levels along the supply chain network. Production planning determines the production targets of each different product along a defined planning horizon (usually ranging from a few months to 2 years), for the entire supply chain, for each different production facility, or for each production line or unit. Production scheduling determines the best operating sequences and the best operating conditions to achieve the inventory and production targets determined by the production plan. Scheduling is done on smaller time horizons (e.g. days or weeks), and includes more operational rules and constraints than planning models. Fig. 1 shows how the length of the time horizon and model accuracy changes, depending on the spatial or time scale, under a hierarchical production planning framework. Nonlinear Blend Scheduling via Inventory Pinch-based Algorithm using Discreteand Continuous-time Models

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

ثبت نام

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

منابع مشابه

Inventory pinch gasoline blend scheduling algorithm combining discrete- and continuous-time models

This work introduces multi-period inventory pinch-based algorithm to solve continuoustime scheduling models (MPIP-C algorithm), a three level method which combines discrete-time approximate scheduling with continuous-time detailed scheduling and with inventory pinchbased optimization of operating states. When applied to gasoline blending, the top level computes optimal recipes for aggregated bl...

متن کامل

A Basic Period Approach for Solving the Economic Lot and Delivery Scheduling in Flexible Flow Lines

In this paper, the problem of lot sizing, scheduling and delivery of several items in a two-stage supply chain over a finite planning horizon is studied. Single supplier via a flexible flow line production system (FFL), produces several items and delivers them directly to an assembly facility. Based on basic period (BP) strategy, a new mixed zero-one nonlinear programming model has been develop...

متن کامل

Planning and Scheduling for Petroleum Refineries Using Mathematical Programming

The objective of this paper is the development and solution of nonlinear and mixed-integer (MIP) optimization models for real-world planning and scheduling problems in petroleum refineries. Firstly, we present a nonlinear planning model that represents a general refinery topology and allows implementation of nonlinear process models as well as blending relations. The optimization model is able ...

متن کامل

DISCRETE AND CONTINUOUS SIZING OPTIMIZATION OF LARGE-SCALE TRUSS STRUCTURES USING DE-MEDT ALGORITHM

Design optimization of structures with discrete and continuous search spaces is a complex optimization problem with lots of local optima. Metaheuristic optimization algorithms, due to not requiring gradient information of the objective function, are efficient tools for solving these problems at a reasonable computational time. In this paper, the Doppler Effect-Mean Euclidian Distance Threshold ...

متن کامل

Multi-objective optimization of discrete time–cost tradeoff problem in project networks using non-dominated sorting genetic algorithm

The time–cost tradeoff problem is one of the most important and applicable problems in project scheduling area. There are many factors that force the mangers to crash the time. This factor could be early utilization, early commissioning and operation, improving the project cash flow, avoiding unfavorable weather conditions, compensating the delays, and so on. Since there is a need to allocate e...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2015