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.

In this research we study the multi-product economic lot scheduling problem (ELSP) with manufacturing and remanufacturing opportunities. Manufacturing and remanufacturing operations are performed on the same production line. Both manufactured and remanufactured products have the same quality thus fulfil the same demand stream. Tang and Teunter (2006) firstly studied this type of economic lot sc...

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

This paper addresses a new mixed integer nonlinear and linear mathematical programming economic lot sizing and scheduling problem in distributed permutation flow shop problem with number of identical factories and machines. Different products must be distributed between the factories and then assignment of products to factories and sequencing of the products assigned to each factory has to be 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 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...