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...

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...

The integration of WiMAX networks and multi-protocol label switching (MPLS) networks, called WiMPLS networks, is the trend for nomadic Internet access in the fourth generation (4G) wireless networks. The base station (BS) in such heterogeneous networks will play the role of bridge and router between the IEEE 802.16 subscriber stations (SSs) and MPLS networks. However, there is no such integrate...

⎯In this paper, we investigate the economic lot scheduling problem (ELSP) with fuzzy demands. We assume that the demand for each product i can be approximated using some triangular membership functions. In this study, we solve the fuzzy ELSP using two basic solution approaches, namely, the Independent Solution (IS) and the Common Cycle (CC) approach. For both approaches, we derive the optimal f...

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...

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 ...

We formulate the well-known economic lot scheduling problem (ELSP) with sequence dependent setup times and costs as a semi-Markov decision process. Using an affine approximation of the bias function, we obtain a semi-infinite linear program determining a lower bound for the minimum average total cost rate. The solution of this problem is directly used in a price-directed dynamic heuristic to de...

The Economic Lot Scheduling Problem (ELSP) has been well-researched for more than 40 years. As the ELSP has been generally seen as NP-hard, researchers have focused on the development of efficient heuristic approaches. In this paper, we consider the time-varying lot size approach to solve the ELSP. A computational study of the existing solution algorithms, Dobson’s heuristic, Hybrid Genetic alg...

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.