We study simulation optimization methods for the stochastic economic lot scheduling problem. In contrast to prior research, we focus on methods that treat this problem as a black box. Based on a large-scale numerical study, we compare approximate dynamic programming with a global search for parameters of simple control policies. We propose two value function approximation schemes based on linea...

A lot sizing and scheduling problem prevalent in small market-driven foundries is studied. There are two related decision levels: (1) the furnace scheduling of metal alloy production, and (2) moulding machine planning which specifies the type and size of production lots.Amixed integer programming (MIP) formulation of the problem is proposed, but is impractical to solve in reasonable computing t...

IJSER © 2016 http://www.ijser.org Task Scheduling in Cloud Computing Aakanksha Sharma Research Scholar, Department of Computer Science & Applications, Kurukshetra University, Kurukshetra136119 Email: [email protected] Sanjay Tyagi Assistant Professor, Department of Computer Science & Applications, Kurukshetra University, Kurukshetra136119 Email: [email protected] Abstract Cloud comp...

The intent of this extended abstract is to briefly describe the work developed by the PhD student Carina Pimentel during her PhD studies, since 2007 until now. The core subject of this work is the development of models and methods for solving medium/short term production planning problems. Two different problems are studied. The first one is a classical lot sizing problem. For this problem seve...

We consider the multi-item discrete lot-sizing and scheduling problem on identical parallel machines. Based on the fact that the machines are identical, we introduce aggregate integer variables instead of individual variables for each machine. For the problem with start-up costs, we show that the inequalities based on a unit flow formulation for each machine can be replaced by a single integer ...

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

This paper surveys Lot-Sizing and Scheduling Models emphasising single-stage cases. The objective here is to present different aspects of such models in the operational research area and notes the most common modern methods to solve them. Metaheuristic methods feature heavily in the research literature. In this work the reader will find many references, though it must be noted that the speed wi...

Wafer fabrication is a capital-intensive and highly complex manufacturing process. In the wafer fabrication facility (fab), wafers are grouped as a lot to go through repeated sequences of operations to build circuitry. Lot scheduling is an important task for manufacturers to improve production efficiency and meet customers’ requirements of on-time delivery. In this research we propose a dispatc...

Purpose - This study presents an extension to a model in the literature for lot-sizing and scheduling small foundry with multiple alternate furnaces. The purpose of is minimize delays inventory costs. In addition, it determines best use load capacity Theoretical framework – Lot-sizing foundries marketplace subject academic interest due its applicability mathematical computational complexity. Ma...