The aim of this work is to propose a mathematical programming model for the Economic Lot Scheduling Problem (ELSP) with performance decay. The main difficulties related to this model are the nonlinearities and/or nonconvexities associated with the dynamic behavior of the system with time. Firstly, the problem is formulated as a Mixed Integer Non Linear Program (MINLP), which is found to be nonc...

I n 1974, Richard A. Easterlin, a coauthor of the work by Easterlin et al. (1) in PNAS, published a seminal article (2) that has generated a huge literature. It sought to explain why the happiness score in the United States (and elsewhere) had stayed roughly constant, whereas income per capita had trended up. This evidence has come to be known as the Easterlin Paradox. His explanation was that ...

The Economic Lot Scheduling Problem (ELSP) is a valuable mathematical model that can support decision-makers to make scheduling decisions. The basic period approach is effective for solving the ELSP. The assumption for applying the basic period approach is that a product must use its maximum production rate to be produced. However, a product can lower its production rate to reduce the average t...

We study the economic lot scheduling problem with two production sources, manufacturing and remanufacturing, for which operations are performed on separate, dedicated lines. We develop an exact algorithm for finding the optimal common-cycle-time policy. The algorithm combines a search for the optimal cycle time with a mixed integer programming (MIP) formulation of the problem given a fixed cycl...

Economies of scale often dictate the choice of a single high speed machine capable of producing a given set of items over the choice of one dedicated machine for each item in the set. A scheduling problem arises when the high speed machine can only produce one item at a time. The problem is further complicated when the machine needs to be setup (often at a cost of both time and money) before a ...

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) is a well known problem that focuses on scheduling the production of multiple items on a single machine such that inventory and setup costs are minimized. In this paper, we extend the ELSP to include price optimization with the objective to maximize profits. A solution approach based on column generation is provided and shown to produce very close to o...

We introduce a dynamic economic lot sizing problem whose production cost considers both setup and the designed-and-yet stretchable production capacity. Demands and the control on production activities drive the evolution of the production system. We give a pseudo-polynomial algorithm for the problem when future demands are known. When there is uncertainty in future demands and there is no holdi...