Search results

Filters

  • Journals

Search results

Number of results: 2
items per page: 25 50 75
Sort by:
Download PDF Download RIS Download Bibtex

Abstract

The paper presents a novel Iterated Local Search (ILS) algorithm to solve multi-item multi-family capacitated lot-sizing problem with setup costs independent of the family sequence. The model has a direct application to real production planning in foundry industry, where the goal is to create the batches of manufactured castings and the sequence of the melted metal loads to prevent delays in delivery of goods to clients. We extended existing models by introducing minimal utilization of furnace capacity during preparing melted alloy. We developed simple and fast ILS algorithm with problem-specific operators that are responsible for the local search procedure. The computational experiments on ten instances of the problem showed that the presence of minimum furnace utilization constraint has great impact on economic and technological conditions of castings production. For all test instances the proposed heuristic is able to provide the results that are comparable to state-of-the art commercial solver.

Go to article

Authors and Affiliations

A. Stawowy
J. Duda
Download PDF Download RIS Download Bibtex

Abstract

In the paper, we present a coordinated production planning and scheduling problem for three major shops in a typical alloy casting

foundry, i.e. a melting shop, molding shop with automatic line and a core shop. The castings, prepared from different metal, have different

weight and different number of cores. Although core preparation does not required as strict coordination with molding plan as metal

preparation in furnaces, some cores may have limited shelf life, depending on the material used, or at least it is usually not the best

organizational practice to prepare them long in advance. Core shop have limited capacity, so the cores for castings that require multiple

cores should be prepared earlier. We present a mixed integer programming model for the coordinated production planning and scheduling

problem of the shops. Then we propose a simple Lagrangian relaxation heuristic and evolutionary based heuristic to solve the coordinated

problem. The applicability of the proposed solution in industrial practice is verified on large instances of the problem with the data

simulating actual production parameters in one of the medium size foundry.

Go to article

Authors and Affiliations

A. Stawowy
J. Duda

This page uses 'cookies'. Learn more