Abstract We consider the economic lot-sizing problem with perishable items (ELS-PI), where each item has a deterministic expiration date. Although all items in stock are equivalent regardless of procurement or expiration date, we allow for an allocation mechanism that defines an order in which the items are allocated to the consumers. In particular, we consider the following allocation mechanisms: First Expiration, First Out (FEFO), Last Expiration, First Out (LEFO), First In, First Out (FIFO) and Last In, First Out (LIFO). We show that the ELS-PI can be solved in polynomial time under all four allocation mechanisms in case of no procurement capacities. This result still holds in case of time-invariant procurement capacities under the FIFO and LEFO allocation mechanisms, but the problem becomes NP-hard under the FEFO and LIFO allocation mechanisms.

Additional Metadata
Keywords Complexity analysis, Dynamic programming, Lot-sizing, Perishable items
Persistent URL dx.doi.org/10.1016/j.ejor.2015.02.021, hdl.handle.net/1765/83893
Journal European Journal of Operational Research
Önal, M, Romeijn, H.E, Sapra, A, & van den Heuvel, W. (2015). The economic lot-sizing problem with perishable items and consumption order preference. European Journal of Operational Research, 244(3), 881–891. doi:10.1016/j.ejor.2015.02.021