Results 1  10
of
681,471
An Evolutionary Computation Approach to the Economic Lot Scheduling Problem
, 1996
"... : The economic lot scheduling problem (ELSP) addresses the problem of scheduling several items  each with its own static, deterministic demand  at a single facility, where only one item can be produced at any time. This classical production planning problem has been studied extensively over the la ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
: The economic lot scheduling problem (ELSP) addresses the problem of scheduling several items  each with its own static, deterministic demand  at a single facility, where only one item can be produced at any time. This classical production planning problem has been studied extensively over
The Stochastic Economic Lot Scheduling Problem: A Survey
, 2005
"... We consider the production of multiple standardized products on a single machine with limited capacity and setup times under random demands and random production times, i.e., the socalled stochastic economic lot scheduling problem (SELSP). The main task for the production manager in this setting i ..."
Abstract
 Add to MetaCart
We consider the production of multiple standardized products on a single machine with limited capacity and setup times under random demands and random production times, i.e., the socalled stochastic economic lot scheduling problem (SELSP). The main task for the production manager in this setting
On the Economic Lot Scheduling Problem with Fuzzy Demands
"... Abstract⎯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 I ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract⎯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
Lecture Plan 1. The Economic Lot Scheduling Problem 2. The Joint Replenishment Problem 1 The Economic Lot Scheduling Problem
, 2004
"... 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 ..."
Abstract
 Add to MetaCart
complicated when the machine needs to be setup (often at a cost of both time and money) before a different item can be produced. The Economic Lot Scheduling Problem (ELSP) is that of scheduling the production of a set of items in a single machine to minimizing the long run average holding and set up cost
A MetaHeuristic Algorithm for Solving Economic Lot Scheduling Problem (ELSP)
, 2010
"... Economic lot scheduling problem has been an important topic in production planning and scheduling research for more than four decades. The problem is known to be NPhard due to its combinatorial nature. In this paper, a metaheuristics algorithm based on Simulated Annealing (SA) is proposed. Beside ..."
Abstract
 Add to MetaCart
Economic lot scheduling problem has been an important topic in production planning and scheduling research for more than four decades. The problem is known to be NPhard due to its combinatorial nature. In this paper, a metaheuristics algorithm based on Simulated Annealing (SA) is proposed
The Economic Lot Scheduling Problem in Flow Lines with SequenceDependent Setups
"... Abstract—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 ..."
Abstract
 Add to MetaCart
proposed solution methods are compared on randomly generated problems. Computational results show a clear superiority of our proposed GA for majority of the test problems. Keywords—Economic lot scheduling problem, finite horizon, genetic algorithm, mixed zeroone nonlinear programming, sequence
19 th International Conference on Production Research A NEW GENETIC ALGORITHM FOR THE ECONOMIC LOT SCHEDULING PROBLEM
"... This paper presents a new genetic algorithm (GA) for the Economic Lot Scheduling Problem (ELSP). The proposed approach enables the calculation of the basic period in the model originally proposed by Bomberger (1966), according to the integer values associated to each item. The algorithm was develope ..."
Abstract
 Add to MetaCart
This paper presents a new genetic algorithm (GA) for the Economic Lot Scheduling Problem (ELSP). The proposed approach enables the calculation of the basic period in the model originally proposed by Bomberger (1966), according to the integer values associated to each item. The algorithm
Simulation Optimization for the Stochastic Economic Lot Scheduling Problem with SequenceDependent Setup Times
"... We consider the stochastic economic lot scheduling problem (SELSP) with lost sales and random demand, where switching between products is subject to sequencedependent setup times. We propose a solution based on simulation optimization using an iterative twostep procedure which combines global poli ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider the stochastic economic lot scheduling problem (SELSP) with lost sales and random demand, where switching between products is subject to sequencedependent setup times. We propose a solution based on simulation optimization using an iterative twostep procedure which combines global
The stochastic economic lot scheduling problem: heavy traffic analysis of dynamic cyclic policies
, 2000
"... We consider two queueing control problems that are stochastic versions of the economic lot scheduling problem: A single server processes N customer classes, and completed units enter a finished goods inventory that services exogenous customer demand. Unsatisfied demand is backordered, and each class ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
We consider two queueing control problems that are stochastic versions of the economic lot scheduling problem: A single server processes N customer classes, and completed units enter a finished goods inventory that services exogenous customer demand. Unsatisfied demand is backordered, and each
Results 1  10
of
681,471