Optimal multi-level lot sizing and scheduling with dedicated machines

This contribution deals with dynamic, capacitated, multi-level lot sizing and scheduling. The basic assumption is that for each item there is exactly one machine that this item can be manufactured on but no two items share a common machine. Finding an optimal solution with a greedy algorithm turns out to be an easy task.

MoreLess

Year of publication:	1994
Authors:	Kimms, Alf
Publisher:	Kiel : Universität Kiel, Institut für Betriebswirtschaftslehre
Subject:	Produktionssteuerung \| Mathematische Optimierung \| Theorie \| Production planning \| lot sizing \| scheduling \| multi-level \| dedicated machines \| optimal greedy algorithm

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Series:	Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; 351
Type of publication:	Book / Working Paper
Type of publication (narrower categories):	Working Paper
Language:	English
Other identifiers:	1002301629 [GVK] hdl:10419/155423 [Handle] RePEc:zbw:cauman:351 [RePEc]
Source:	EconStor

Persistent link: https://www.econbiz.de/10011613748