In this paper, we consider a lot-sizing problem with the remanufacturing option under parameter uncertainties imposed on demands and returns. Remanufacturing has recently been fast growing area of interest for many researchers due to increasing awareness reducing waste in production environments, particular studies involving simultaneously are very scarce literature. We first present min-max de...

This paper addresses the common cycle multi-product lot-scheduling problem in flexible flow lines (FFL) where the product demands are deterministic and constant over a finite planning horizon. Objective is minimizing the sum of setup costs, work-in-process and final products inventory holding costs per time unite while satisfying the demands without backlogging. This problem consists of a combi...

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

There are many benefits for coordination of multiple suppliers when single supplier cannot satisfy buyer demands. In addition, buyer needs to purchase multiple items in a real supply chain. So, a model that satisfies these requests has many advantages. We extend the existing approaches in the literature that assume all suppliers need to be put on a common replenishment cycle and each supplier d...

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

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

The economic lot scheduling problem has driven considerable amount of research. The problem is NP-hard and recent research is focused on finding heuristic solutions rather than searching for optimal solutions. This paper introduces a heuristic method using a tabu search algorithm to solve the economic lot scheduling problem. Diversification and intensification schemes are employed to improve th...