A knapsack problem as a tool to solve the production planning problem in small foundries

Camargo, Victor Claudio Bento de; Mattiolli, Leandro; Toledo, Franklina Maria Bragion de

doi:10.1016/j.cor.2010.10.023

Cited by 33 publications

(25 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Matičević et al [25] developed a new mathematical model for scheduling foundry operations based on the Manufacturing Resource Planning, Just in Time, and Optimized Production Technology concepts. More recently, Camargo et al [26] considered the production planning problem in small foundries and proposed the heuristic to solve the problem in a hierarchical way, combined the genetic algorithm with a knapsack problem algorithm to explore a larger set of alloy sequences, but did not consider the multiobjective function which could reduce both waste penalties and costs of setup, inventory, and backlogging. Gravel et al [27] presented a genetic algorithm for the solution of an industrial scheduling problem in an Alcan aluminum foundry situated in Québec and sought the best processing sequence for n orders on m parallel machines.…”

Section: Literature Reviewmentioning

confidence: 99%

A Production Planning Model for Make-to-Order Foundry Flow Shop with Capacity Constraint

Guo

Liu

et al. 2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

The mode of production in the modern manufacturing enterprise mainly prefers to MTO (Make-to-Order); how to reasonably arrange the production plan has become a very common and urgent problem for enterprises’ managers to improve inner production reformation in the competitive market environment. In this paper, a mathematical model of production planning is proposed to maximize the profit with capacity constraint. Four kinds of cost factors (material cost, process cost, delay cost, and facility occupy cost) are considered in the proposed model. Different factors not only result in different profit but also result in different satisfaction degrees of customers. Particularly, the delay cost and facility occupy cost cannot reach the minimum at the same time; the two objectives are interactional. This paper presents a mathematical model based on the actual production process of a foundry flow shop. An improved genetic algorithm (IGA) is proposed to solve the biobjective problem of the model. Also, the gene encoding and decoding, the definition of fitness function, and genetic operators have been illustrated. In addition, the proposed algorithm is used to solve the production planning problem of a foundry flow shop in a casting enterprise. And comparisons with other recently published algorithms show the efficiency and effectiveness of the proposed algorithm.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A Production Planning Model for Make-to-Order Foundry Flow Shop with Capacity Constraint

Guo

Liu

et al. 2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…[4] have considered the similar problem. The authors have proposed the heuristic that solves the problem in a hierarchical way.…”

Section: The Examples Of Solving the Foundry Planning Problemsmentioning

confidence: 99%

Models and Algorithms for Production Planning and Scheduling in Foundries - Current State and Development Perspectives

Stawowy¹,

Duda²

2012

Archives of Foundry Engineering

View full text Add to dashboard Cite

Mathematical programming, constraint programming and computational intelligence techniques, presented in the literature in the field of operations research and production management, are generally inadequate for planning real-life production process. These methods are in fact dedicated to solving the standard problems such as shop floor scheduling or lot-sizing, or their simple combinations such as scheduling with batching. Whereas many real-world production planning problems require the simultaneous solution of several problems (in addition to task scheduling and lot-sizing, the problems such as cutting, workforce scheduling, packing and transport issues), including the problems that are difficult to structure. The article presents examples and classification of production planning and scheduling systems in the foundry industry described in the literature, and also outlines the possible development directions of models and algorithms used in such systems.

show abstract

“…Since Araujo et al (2007), many other authors have also researched the intergrated lot-sizing and sequencing problem, with material preparation at a prior stage, in a wide range of industrial settings, for example, in soft drink production (Toledo et al, 2009and Ferreira et al, 2009, animal feed (Toso et al, 2009 andClark et al, 2010), electrofused grains (Luche et al, 2009), glass bottles (Almada- Lobo et al, 2007Lobo et al, , 2008, foundries (Araujo et al, 2008;Tonaki andToledo, 2010 andCamargo et al, 2012), yogurt packaging company (Marinelli et al, 2007), pharmaceutical company (Stadtler, 2011), and sand casting operations (Hans and Van de Velde, 2011).…”

Section: Introductionmentioning

confidence: 99%

A priori reformulations for joint rolling-horizon scheduling of materials processing and lot-sizing problem

Araújo

Clark

2013

Computers & Industrial Engineering

View full text Add to dashboard Cite

In a previous paper (Araujo et al. 2007), the authors proposed a lot sizing and sequencing model for a production process where a key material is prepared and then transformed into different final items. The lot sizing decisions concern not only the production of final items, but also that of the prepared material in order to take account of their sequence-dependent setup costs and times. The number of articles published in recent years shows the relevance of this problem in various industrial settings. In this paper, facility location reformulation and strengthening contraints are newly applied to improve the quality and computing time of the solution. Three alternative metaheuristics are used to fix the setup variables, resulting in much improved performance over previous research, especially regarding the use of the metaheuristics for larger instances.

show abstract

A knapsack problem as a tool to solve the production planning problem in small foundries

Cited by 33 publications

References 15 publications

A Production Planning Model for Make-to-Order Foundry Flow Shop with Capacity Constraint

A Production Planning Model for Make-to-Order Foundry Flow Shop with Capacity Constraint

Models and Algorithms for Production Planning and Scheduling in Foundries - Current State and Development Perspectives

A priori reformulations for joint rolling-horizon scheduling of materials processing and lot-sizing problem

Contact Info

Product

Resources

About