A polynomial algorithm for a lot‐sizing problem with backlogging, outsourcing and limited inventory

A polynomial algorithm for a lot‐sizing problem with backlogging, outsourcing and limited inventory

0.00 Avg rating0 Votes
Article ID: iaor2013334
Volume: 64
Issue: 1
Start Page Number: 200
End Page Number: 210
Publication Date: Jan 2013
Journal: Computers & Industrial Engineering
Authors: , , ,
Keywords: backorders, lot sizing, outsourcing, setup time, luxury goods
Abstract:

This paper addresses a real‐life production planning problem arising in a manufacturer of luxury goods. This problem can be modeled as a single item dynamic lot‐sizing model with backlogging, outsourcing and inventory capacity. Setup cost is included in the production cost function, and the production level at each period is unbounded. The holding, backlogging and outsourcing cost functions are assumed to be linear. The backlogging level at each period is also limited. The goal is to satisfy all demands in the planning horizon at minimal total cost. We show that this problem can be solved in O(T 4 log T) time where T is the number of periods in the planning horizon.

Reviews

Required fields are marked *. Your email address will not be published.