Multi-level, single-machine, lot sizing and scheduling : (with initial inventory)

A. Kimms

This paper presents a mixed-integer program for the dynamic lot sizing and scheduling problem in a multi-level, single-machine environment. It turns out that in contrast to single-level problems the integration of initial inventory is a crucial aspect if generality should not be lost. It is shown how problem instances can efficiently be solved to suboptimality by using a so-called randomized regret based heuristic.

Year of publication:	1993
Authors:	Kimms, Alf
Publisher:	Kiel : Inst. für Betriebswirtschaftslehre
Subject:	Production planning \| lot sizing \| scheduling \| PLSP \| heuristics \| multi-level \| Produktionssteuerung \| Production control \| Theorie \| Theory

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

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

A service of the