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

Scheduling is a problem that occurs in a large variety of forms with huge cumulative economic and social consequences. Proper scheduling can provide better utilization of scarce and expensive resources as well as higher satisfaction for individuals such as customers and employees. For this reason, there has been a lot of effort expended over a large number of years on algorithms for automatic s...

The problem of lot sizing, sequencing and scheduling multiple products in flow line production systems has been studied by several authors. Almost all of the researches in this area assumed that setup times and costs are sequence –independent even though sequence dependent setups are common in practice. In this paper we present a new mixed integer non linear program (MINLP) and a heuristic meth...

In this paper, we revisit the economic lot scheduling problem (ELSP), where a family of products is produced on a single machine, or facility, on a continual basis. Our focus is on the determination of a feasible production schedule, including the manufacturing batch size of each item. We assume that total backordering is permissible and that each of the products has a limited post-production s...

We study a variant of the stochastic economic lot scheduling problem (SELSP) in which a single production facility must produce several different grades of a family of products to meet random stationary demand for each grade from a common finished-goods (FG) inventory buffer with limited storage capacity. Demand that can not be satisfied directly from inventory is lost. Raw material is always a...

optimization models have been used to support decision making in production planning for a long time. however, several of those models are deterministic and do not address the variability that is present in some of the data. robust optimization is a methodology which can deal with the uncertainty or variability in optimization problems by computing a solution which is feasible for all possible ...

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