Optimization of mixed casting processes considering discrete ingot sizes

Park, Yong Kuk; Yang, Jung–Min

doi:10.1007/s12206-009-0428-y

Cited by 10 publications

(13 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It considers several real‐world constraints about job grouping, precedence constraints, management of idle time, and processing time. A different linear programming model was proposed by Park and Yang () who studied the steel casting process in a small/medium‐sized foundry.…”

Section: Related Workmentioning

confidence: 99%

Modeling and solving the steelmaking and casting scheduling problem

Armellini

Borzone

Ceschia

et al. 2018

Int Trans Operational Res

View full text Add to dashboard Cite

We propose a general model for the problem of planning and scheduling steelmaking and casting activities obtained by combining common features and constraints of the operations from a real plant and the literature. For tackling the problem, we develop a simulated annealing approach based on a solution space made of job permutations, which uses as submodule a chronological constructive procedure that assigns processing times and resources to jobs. Our technique, properly tuned in a statistically principled way, is able to find good solutions for a large range of different settings and horizons. In addition, it outperforms both a greedy procedure and a constraint‐based solver developed for comparison purposes on almost all instances. Finally, we have collected several real‐world instances that we make available on the web along with the solution validator and our best results.

show abstract

Section: Related Workmentioning

confidence: 99%

Modeling and solving the steelmaking and casting scheduling problem

Armellini

Borzone

Ceschia

et al. 2018

Int Trans Operational Res

View full text Add to dashboard Cite

show abstract

“…Then, the new population is formed. This process is continued until a termination criterion is met [26,27].…”

Section: Basis Of Genetic Algorithmmentioning

confidence: 99%

A new genetic algorithm for flexible job-shop scheduling problems

2015

View full text Add to dashboard Cite

Flexible job-shop scheduling problem (FJSP), which is proved to be NP-hard, is an extension of the classical job-shop scheduling problem. In this paper, we propose a new genetic algorithm (NGA) to solve FJSP to minimize makespan. This new algorithm uses a new chromosome representation and adopts different strategies for crossover and mutation. The proposed algorithm is validated on a series of benchmark data sets and tested on data from a drug manufacturing company. Experimental results prove that the NGA is more efficient and competitive than some other existing algorithms.

show abstract

“…Park and Yang [14] have introduced a Linear Programming (LP) optimization model for casting scheduling in job-shop type foundries. They have considered a typical foundry where various castings in different sizes and shapes are made out of molten alloy, which is obtained by melting ingots in a limited number of furnaces with different capacities.…”

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

Optimization of mixed casting processes considering discrete ingot sizes

Cited by 10 publications

References 14 publications

Modeling and solving the steelmaking and casting scheduling problem

Modeling and solving the steelmaking and casting scheduling problem

A new genetic algorithm for flexible job-shop scheduling problems

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

Contact Info

Product

Resources

About