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

8Citations
Citations of this article
31Readers
Mendeley users who have this article in their library.

Abstract

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. © 2012, Versita. All rights reserved.

Cite

CITATION STYLE

APA

Stawowy, A., & Duda, J. (2012). Models and Algorithms for Production Planning and Scheduling in Foundries - Current State and Development Perspectives. Archives of Foundry Engineering, 12(2), 69–74. https://doi.org/10.2478/v10266-012-0039-4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free