We consider the multilevel lot-sizing problem with production capacities (MLSP-PC), in which production and transportation decisions are made for a serial supply chain with capacitated production and concave cost functions. Existing approaches to the multistage version of this problem are limited to nonspeculative cost functions—up to now, no algorithm for the multistage version of this model w...

This paper presents a novel mathematical programming approach to the single-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times and setup costs. The approach is partly based on the earlier work of Haase and Kimms [2000. Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities. International Journal of ...

In this paper we introduce a new class of OR games: economic lot-sizing (ELS) games. There are a number of retailers that have a known demand for a fixed number of periods. To satisfy demand the retailers order products at the same manufacturer. By placing joint orders instead of individual orders, costs can be reduced and a cooperative game arises. In this paper we show that ELS games are bala...

In this paper, a new fix-and-optimize (FO) approach is proposed for two dynamic multi-level capacitated lot sizing problems (MLCLSP), the MLCLSP without setup carryover and the MLCLSP with setup carryover. Given an MIP model of a lot sizing problem, the approach iteratively solves a series of subproblems of the model until no better solution can be found. Each sub-problem re-optimizes a subset ...

Waste accumulation in landfills, global warming and the need to preserve finite raw materials push governments industries shift towards a circular economy. Industrial symbiosis represents sustainable way of sharing resources converting unavoidable production residues into useful added-value products. In this context, we introduce new planning problem arisen between two units (PU) within an indu...

Solving multi-level capacitated lot-sizing problems is still a challenging task, despite of increasing computational power and faster algorithms. In this paper a new approach combining an ant-based algorithm with an exact solver for (mixed-integer) linear programs is presented. A MAX-MIN ant system is developed to determine the principle production decisions, a LP/MIP solver is used to calculat...