Modelling Production Management Problems by Knowledge-Based Approximations
when the manufacturing system must initiate to process items
by what machining center (or sequence of machining centers) the items must be processed
in what rates the working time of each machining center must beshared and assigned to items of different product families
Formally the PM problem can be started in terms of a dynamic scheduling problem, for given due date constraints of orders from customers and for given release constraints of material from suppliers.
A formal solution of this problem, suitable for a practical use in a multi-products multi-center industrial department, has not yet been found.
Approximation is mandatory. But it is not an easy task, since an approximated solution of a combinatorial optimization problem must be found, together with some criteria to evaluate the approximation accuracy.
In author’s opinion this problem can be approached by using the wide experience of industrial managers, thus adopting knowledge-based criteria from production management practice.
The contents of this contribution will be focused on such an approach, first introducing a K-B approximation methodology, then analyzing its applicability in solving PM problems.
KeywordsProduct Family Machine Center Dynamic Schedule Part Family Internal Order
Unable to display preview. Download preview PDF.
- A. Villa, S.Rossetto-“Rule based production planning in flexible ma-nufacturing systems” - Int. J. Flex. Manufacturing Systems, 1989, vol.2,5–24.Google Scholar
- J. L. Burbidge “The introduction of Group Technology” - Halsted Press, J. Wiley & Sons, New York, 1975.Google Scholar
- H.G.Campbell, R.A.Dudek, M.L.Smith - “A heuristic algorithm for the n job m machine sequencing problem” - Management Sci.,1970,vol.16,n.10.Google Scholar
- G. L. Nemhauser, A. H. Rinnooy Kan and Todd (eds) - “Handbook of operations research and management science” - Elsevier, Amsterdam, 1989.Google Scholar