The talk focuses on the simultaneous resource allocation, lot-sizing and scheduling in a multi-machine, deterministic ELSP environment. The objective is to minimize the long-run average production, setup, inventory, and shortage penalty costs. We develop a concave minimization model of the problem, generate heuristic solutions, lower bounding methods and present computational results.

This paper proposes a new heuristic for solving the economic lot scheduling problem in flow shops under the Power-of-Two policy. A review of relevant literature shows that the heuristic in Ouenniche and Boctor [15] not only solves this problem with the best objective function value among the existing solution approaches, but also generates a feasible production schedule. However there are sever...

1.1 The background on the ELSP The Economic Lot Scheduling Problem (ELSP) is concerned with scheduling the cyclical production of n≥2 products on a single facility in lots that differ in size and, consequently, differ in production times and cycles. The cost items involved are: setup cost and inventory holding cost. A popular category of research for the ELSP is so-called “basic period-based cy...

In this paper we discuss stochastic Economic Lot Scheduling Problems (ELSP), i.e., settings where several items need to be produced in a common facility with limited capacity, under significant uncertainty regarding demands, production times, setup times, or combinations thereof. We propose a class of production/ inventory strategies for stochastic ELSPs and describe how a strategy which minimi...

The economic lot scheduling problem (ELSP) addresses the problem of scheduling several items each with its own static, deterministic demand at a single facility, where only one item can be produced at any time. This classical production planning problem has been studied extensively over the last three decades and various heuristic solution methods have been proposed, most of them based on the c...