The multi-level capacitated lot sizing problem with linked lot sizes and non-deterministic demands

چکیده مقاله

The multi-level capacitated lot-sizing problem with linked lot sizes (MLCLSP-L) is the
problem of determining production quantities in multi-stage production settings, such that the
sum of setup and holding costs is minimized. The multi-level capacitated lot-sizing problem
(MLCLSP) does not consider any setup carryover between two successive periods. As an
extension, the MLCLSP-L for short allows the setup state of a resource to be carried over
from the current period to the next period. In this paper, we develop and solve the MLCLSPL
by a real-world problem that arises in production. Here, the MLCLSP-L is extended to
include resource and stock capacity constraint, shortages backlogging and lost sales,
outsourcing and fuzzy demands. Also, we used Delgado et al. (1998) approach to convert
fuzzy demands into crisp demands. The aim is minimizing sum of inventory holding costs,
overtime costs of resource, setup costs, outsourcing costs, shortages backlogging and lost
sales costs. Finally we implement LINGO software to solving this model.

دریافت لینک دانلود مقاله