scholarly journals Mathematical Programming for Lot Sizing and Production Scheduling in Foundries

2014 ◽  
Vol 14 (3) ◽  
pp. 17-20 ◽  
Author(s):  
J. Duda ◽  
A. Stawowy ◽  
R. Basiura
Keyword(s):  
Mathematical Programming ◽  
Production Scheduling ◽  
Programming Model ◽  
Lot Sizing ◽  
Mathematical Programming Model ◽  
Rolling Horizon Planning ◽  
Horizon Planning ◽  
Number Of Customers ◽  
Lot Sizing And Scheduling ◽  
Melted Metal

Abstract The problem considered in the paper is motivated by production planning in a foundry equipped with the furnace and casting line, which provides a variety of castings in various grades of cast iron/steel for a large number of customers. The quantity of molten metal does not exceed the capacity of the furnace, the load is a particular type of metal from which the products are made. The goal is to create the order of the melted metal loads to prevent delays in delivery of goods to customers. This problem is generally considered as a lot-sizing and scheduling problem. The paper describes a mathematical programming model that formally defines the optimization problem and its relaxed version that is based on the conception of rolling-horizon planning.

scholarly journals Production Scheduling for the Furnace - Casting Line System

2013 ◽  
Vol 13 (3) ◽  
pp. 84-87 ◽  
Author(s):  
A. Stawowy ◽  
J. Duda
Keyword(s):  
Computational Intelligence ◽  
Production Scheduling ◽  
Lot Sizing ◽  
Test Problems ◽  
Scheduling Problem ◽  
Line System ◽  
Number Of Customers ◽  
Lot Sizing And Scheduling ◽  
Melted Metal ◽  
Made In

Abstract The problem considered in the paper is motivated by production planning in a foundry equipped with the furnace and casting line, which provides a variety of castings in various grades of cast iron/steel for a large number of customers. The quantity of molten metal does not exceed the capacity of the furnace, the load is a particular type of metal from which the products are made in the automatic casting lines. The goal is to create the order of the melted metal loads to prevent delays in delivery of goods to customers. This problem is generally considered as a lot-sizing and scheduling problem. The paper describes two computational intelligence algorithms for simultaneous grouping and scheduling tasks and presents the results achieved by these algorithms for example test problems.

scholarly journals Production Scheduling under Fuzziness for the Furnace - Casting Line System

2015 ◽  
Vol 15 (4) ◽  
pp. 29-32 ◽  
Author(s):  
J. Duda ◽  
A. Stawowy
Keyword(s):  
Production Scheduling ◽  
Test Problem ◽  
Lot Sizing ◽  
Scheduling Problem ◽  
Line System ◽  
Classic Approach ◽  
Number Of Customers ◽  
Lot Sizing And Scheduling ◽  
Fuzzy Parameters ◽  
Melted Metal

Abstract The problem considered in the paper is motivated by production planning in a foundry equipped with a furnace and a casting line, which provides a variety of castings in various grades of cast iron/steel for a large number of customers. The goal is to create the order of the melted metal loads to prevent delays in delivery of goods to customers. This problem is generally considered as a lot-sizing and scheduling problem. However, contrary to the classic approach, we assumed the fuzzy nature of the demand set for a given day. The paper describes a genetic algorithm adapted to take into account the fuzzy parameters of simultaneous grouping and scheduling tasks and presents the results achieved by the algorithm for example test problem.

scholarly journals The capacitated m two node survivable star problem

2017 ◽  
Vol 27 (3) ◽  
pp. 341-366 ◽  
Author(s):  
Gabriel Bayá ◽  
Antonio Mauttone ◽  
Franco Robledo
Keyword(s):  
Mathematical Programming ◽  
Programming Model ◽  
Connected Components ◽  
Mathematical Programming Model ◽  
Local Searches ◽  
Benchmark Instances ◽  
Ring Star Problem ◽  
Definition Of ◽  
Exact Resolution ◽  
Number Of Customers

In this paper, we address the problem of network design with redundant connections, often faced by operators of telephone and internet services. The network connects customers with one master node and is built by taking into account the rules that shape its construction, such as number of customers, number of components and types of links, in order to meet operational needs and technical constraints. We propose a combinatorial optimization problem called CmTNSSP (Capacitated m Two-Node-Survivable Star Problem), a relaxation of CmRSP (Capacitated m Ring Star Problem). In this variant of CmRSP, the rings are not constrained to be cycles; instead, they can be two-node connected components. The contributions of this paper are: (a) the introduction and definition of a new problem, (b) the specification of a mathematical programming model of the problem to be treated, and (c) the approximate resolution thereof through a GRASP metaheuristic, which alternates local searches that obtain incrementally better solutions, and exact resolution local searches based on mathematical programming models, particularly Integer Linear Programming ones. Computational results obtained by the developed algorithms show robustness and competitiveness when compared to results of the literature relative to benchmark instances. Likewise, the experiments show the relevance of considering the specific variant of the problem studied in this work.

scholarly journals A Mathematical Programming Model to Determine Objective Weights for the Interval Extension of TOPSIS

2018 ◽  
Vol 2018 ◽  
pp. 1-6 ◽  
Author(s):  
Hai Shen ◽  
Lingyu Hu ◽  
Kin Keung Lai
Keyword(s):  
Mathematical Programming ◽  
Input Data ◽  
Programming Model ◽  
Multiple Criteria Decision Making ◽  
Decision Makers ◽  
Mathematical Programming Model ◽  
Topsis Method ◽  
Data Set ◽  
Interval Extension ◽  
Interval Valued

Technique for Order Performance by Similarity to Ideal Solution (TOPSIS) method has been extended in previous literature to consider the situation with interval input data. However, the weights associated with criteria are still subjectively assigned by decision makers. This paper develops a mathematical programming model to determine objective weights for the implementation of interval extension of TOPSIS. Our method not only takes into account the optimization of interval-valued Multiple Criteria Decision Making (MCDM) problems, but also determines the weights only based upon the data set itself. An illustrative example is performed to compare our results with that of existing literature.

CREDIBILITY-BASED FUZZY MATHEMATICAL PROGRAMMING MODEL FOR PORTFOLIO SELECTION UNDER UNCERTAINTY

2014 ◽  
Vol 13 (01) ◽  
pp. 101-135 ◽  
Author(s):  
MUKESH KUMAR MEHLAWAT ◽  
PANKAJ GUPTA
Keyword(s):  
Mathematical Programming ◽  
Portfolio Selection ◽  
Programming Model ◽  
Fuzzy Optimization ◽  
Chance Constrained Programming ◽  
Fuzzy Mathematical Programming ◽  
Mathematical Programming Model ◽  
Two Phase ◽  
Solution Approach ◽  
Practical Applications

In this paper, we develop a hybrid bi-objective credibility-based fuzzy mathematical programming model for portfolio selection under fuzzy environment. To deal with imprecise parameters, we use a hybrid credibility-based approach that combines the expected value and chance constrained programming techniques. The model simultaneously maximizes the portfolio return and minimizes the portfolio risk. We also consider an additional important criterion, namely, portfolio liquidity as a constraint in the model to make it better suited for practical applications. The proposed fuzzy optimization model is solved using a two-phase approach. An empirical study is included to demonstrate applicability of the proposed model and the solution approach in real-world applications of portfolio selection.

scholarly journals Mathematical programming models for agri-environmental policy analysis: A case study from the White Carpathians

2012 ◽  
Vol 52 (No. 2) ◽  
pp. 51-66 ◽  
Author(s):  
P. Havlík ◽  
F. Jacquet ◽  
Boisson J-M ◽  
S. Hejduk ◽  
P. Veselý
Keyword(s):  
Mathematical Programming ◽  
Programming Model ◽  
Mathematical Programming Model ◽  
The Czech Republic ◽  
Environmental Goods ◽  
Environmental Good ◽  
Environmental Policy Analysis ◽  
Grassland Biodiversity ◽  
White Carpathians

BEGRAB_PRO.1 – a mathematical programming model for BEef and GRAssland Biodiversity PRoduction Optimisation – elaborated for analysis of organic suckler cow farms in the Protected Landscape Area White Carpathians, the Czech Republic, is presented and applied to the analysis of jointness between several environmental goods. In this way, the paper complements recent studies on jointness between commodities and non-commodities. If these goods are joint in production, agri-environmental payments must be carefully designed because they do not influence only production of the environmental good they are intended for but also the production of other environmental goods. If jointness is negative, any increase in the payment for an environmental good leads to a decrease in production of other environmental goods.

Sign in / Sign up

Export Citation Format

Share Document