scholarly journals Production optimization by using integer linear programming under a practical approach

2020 ◽  
pp. 1-7
Author(s):  
José Manuel Velarde-Cantú ◽  
Mauricio López-Acosta ◽  
Allán Chacara-Montes ◽  
Ernesto Ramírez-Cárdenas
Keyword(s):  
Mathematical Model ◽  
Linear Programming ◽  
Integer Linear Programming ◽  
Production Scheduling ◽  
Practical Problem ◽  
Production Optimization ◽  
Practical Approach ◽  
Product Mix ◽  
Model Based

This paper addresses the problem of production scheduling under a practical approach, which seeks to find out what would be the product mix to ensure the company to obtain the most useful, also requires that these combinations of products obtained from quickly and efficiently contributing thus to achieve lower costs associated with production. A specific mathematical model based on integer linear programming applied specifically to the product mix is presented, as well as the results obtained from the practical problem from the use of the model in integer linear programming, the use of the software and considering the own conditions of the problem addressed here.

scholarly journals A New Peak-Shaving Model Based on Mixed Integer Linear Programming with Variable Peak-Shaving Order

Energies ◽  
2021 ◽  
Vol 14 (4) ◽  
pp. 887
Author(s):  
Xianliang Cheng ◽  
Suzhen Feng ◽  
Yanxuan Huang ◽  
Jinwen Wang
Keyword(s):  
Linear Programming ◽  
Power Systems ◽  
Integer Linear Programming ◽  
Mixed Integer Linear Programming ◽  
Mixed Integer ◽  
Time Interval ◽  
Renewable Energy Resources ◽  
Load Curve ◽  
Peak Shaving ◽  
Model Based

Peak-shaving is a very efficient and practical strategy for a day-ahead hydropower scheduling in power systems, usually aiming to appropriately schedule hourly (or in less time interval) power generations of individual plants so as to smooth the load curve while enforcing the energy production target of each plant. Nowadays, the power marketization and booming development of renewable energy resources are complicating the constraints and diversifying the objectives, bringing challenges for the peak-shaving method to be more flexible and efficient. Without a pre-set or fixed peak-shaving order of plants, this paper formulates a new peak-shaving model based on the mixed integer linear programming (MILP) to solve the scheduling problem in an optimization way. Compared with the traditional peak-shaving methods that need to determine the order of plants to peak-shave the load curve one by one, the present model has better flexibility as it can handle the plant-based operating zones and prioritize the constraints and objectives more easily. With application to six cascaded hydropower reservoirs on the Lancang River in China, the model is tested efficient and practical in engineering perspective.

scholarly journals Implementation of a Mathematical Model to Improve Sustainability in the Handling of Transport Costs in a Distribution Network

2019 ◽  
Vol 12 (1) ◽  
pp. 63
Author(s):  
José Manuel Velarde ◽  
Susana García ◽  
Mauricio López ◽  
Alfredo Bueno-Solano
Keyword(s):  
Mathematical Model ◽  
Linear Programming ◽  
Integer Linear Programming ◽  
Mixed Integer Linear Programming ◽  
Numerical Study ◽  
Distribution Network ◽  
Transport Cost ◽  
Mixed Integer ◽  
Distribution Area ◽  
Use Of Resources

This work considers the application of a mathematical model using mixed-integer linear programming for the vehicle routing problem. The model aims at establishing the distribution routes departing from a distribution center to each customer in order to reduce the transport cost associated with these routes. The study considers the use of a fleet of different capacities in the distribution network, which presents the special characteristic of a star network and which must meet different efficiency criteria, such as the fulfillment of each customer’s demand, the vehicle carrying capacity, work schedule, and sustainable use of resources. The intention is to find the amount of equipment suitable to satisfy the demand, thus improving the level of customer service, optimizing the use of both human and economic resources in the distribution area, and leveraging maximum vehicle capacity usage. The MILP mixed-integer linear programming mathematical model of the case study is presented, as well as the corresponding numerical study.

A MIXED-INTEGER LINEAR PROGRAMMING (MILP) MODEL FOR SHORT-RANGE PRODUCTION SCHEDULING OF CEMENT QUARRY OPERATIONS

2010 ◽  
Vol 27 (03) ◽  
pp. 315-333 ◽  
Author(s):  
SAFI UR REHMAN ◽  
MOHAMMAD WAQAR ALI ASAD
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Production Scheduling ◽  
Mixed Integer Linear Programming ◽  
Short Range ◽  
Raw Materials ◽  
Chemical Constituents ◽  
Cost Savings ◽  
Mixed Integer ◽  
Cement Manufacturing

A limestone quarry is the major source for supplying raw materials for cement manufacturing operations. Depending upon the available reserves, a quarry is divided into thousands of mineable blocks. Hence, raw materials inventory is identified in terms of a block model projecting the quantity and quality of critical chemical constituents desired in the cement manufacturing process. An individual block never satisfies the process quality constraints; therefore, the blending of various quarry blocks with few additives purchased from the market becomes a prerequisite. As each block is represented as an integer (0-1) variable, the objective of an optimal quarry production scheduling model is sequential mining of these blocks such that the plant quantity and quality requirements are satisfied at the lowest possible cost. This paper presents a new mixed-integer linear programming (MILP) based blending optimization model accomplishing the defined objective as a short-range production planning tool. The benefits of the model are established through a case study of an existing cement manufacturing operation in the northern part of Pakistan, ensuring significant cost savings compared to schedules produced manually.

scholarly journals Modeling and implementation of sequencing of tasks to Maximize the Processing in an organization

2014 ◽  
Vol 12 (2) ◽  
pp. 3286-3291
Author(s):  
A. Namir ◽  
Amina EL Kebbaj ◽  
R. Namir ◽  
S. Ezzbady
Keyword(s):  
Linear Programming ◽  
Organizational Structure ◽  
Integer Linear Programming ◽  
Waiting Time ◽  
Practical Approach ◽  
Level Of Service ◽  
In Series

The main objective of this work is to conceive a practical approach to improve customer’s satisfaction which is generally considered as the pillar of the development of customer fidelity for the company. It is necessary to have a platform which we master to manage to satisfy the customer by studying its needs, by having the capacity to be close and serving him for the shortest deadlines.The waiting time before being served is systematically badly noted by the customers and can cause their dissatisfactions. For that, it is necessary to find a way to decrease the dissatisfaction of the customer by improving the service.We propose in this work, a simple and practical approach for modeling and implementation of a sequencing of tasks to maximize the processing in an organization. This approach respects the constraints of the organization and eliminates any shape of wasting of time at the level of service. She can be personalized for any company, as long as an organizational structure including the actors is defined, the authorities as well as the skills required for every participant in the organization.The problem is mathematically modeled by an integer linear programming and in series solved numerically by respecting rules of priority at the level of the departments. At the end, practical examples to illustrate the work are given.

scholarly journals A practical, long-term production scheduling model in open pit mines using integer linear programming

2020 ◽  
Vol 120 (12) ◽  
Author(s):  
J. Gholamnejad ◽  
R. Lotfian ◽  
S. Kasmaeeyazdi
Keyword(s):  
Linear Programming ◽  
Mathematical Programming ◽  
Integer Linear Programming ◽  
Production Scheduling ◽  
Mine Planning ◽  
Open Pit ◽  
Mixed Integer ◽  
Small Scale ◽  
Mining Equipment

SYNOPSIS Long-term production scheduling is a major step in open pit mine planning and design. It aims to maximize the net present value (NPV) of the cash flows from a mining project while satisfying all the operational constraints, such as grade blending, ore production, mining capacity, and pit slope during each scheduling period. Long-term plans not only determine the cash flow generated over the mine life, but are also the basis for medium- and short-term production scheduling. Mathematical programming methods, such as linear programming, mixed integer linear programming, dynamic programming, and graph theory, have shown to be well suited for optimization of mine production scheduling. However, the long-term plans generated by the mathematical formulations mostly create a scattered block extraction order on several benches that cannot be implemented in practice. The reason is the excessive movement of mining equipment between benches in a single scheduling period. In this paper, an alternative integer linear programming (ILP) formulation is presented for long-term production scheduling that reduced the number of active benches in any scheduling period. Numerical results of the proposed model on a small-scale open pit gold mine show a 34% reduction in the average number of working benches in a given scheduling period. Keywords: long-term production scheduling, mathematical programming, practical plans, equipment movements.

scholarly journals THE PROBLEM OF DISCRETE OPTIMIZATION ON THE CONSTRUCTION OF A SLIDING SCHEDULE OF EMPLOYEES SHIFTS

2020 ◽  
Vol 7 (3) ◽  
pp. 038-043
Author(s):  
A. N. Shingareva ◽  
◽  
M. N. Rasskazova ◽  
Keyword(s):  
Mathematical Model ◽  
Linear Programming ◽  
Programming Problem ◽  
Integer Linear Programming ◽  
Discrete Optimization ◽  
Linear Programming Problem ◽  
Target Function ◽  
Work Schedules ◽  
Integer Linear Programming Problem ◽  
Shift Schedules

This article discusses a linear programming problem on the construction of rolling shift schedules for warehouse employees. A mathematical model of an integer linear programming problem has been developed. The target function can be either minimization of the total number of employees or minimization of wages. Experiments were carried out for various work schedules, which showed the effectiveness of the proposed approach.

Sign in / Sign up

Export Citation Format

Share Document