Results 1 
5 of
5
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 policy search with local search heuristics for the traveling salesman sequencing subproblem. To optimize the production cycle, we compare two criteria: minimizing total setup times and evenly distributing setups to obtain a more regular production cycle. Based on a numerical study, we find that a policy with a balanced production cycle outperforms other policies with unbalanced cycles.
with lost sales
, 2004
"... with lost sales To operate a multiple product manufacturing system under a CONWIP control policy, one must decide how to assign kanbans to products. With a fixed total number of kanbans in a competitive environment, the goal is to determine their allocation to product types in order to minimize lost ..."
Abstract
 Add to MetaCart
with lost sales To operate a multiple product manufacturing system under a CONWIP control policy, one must decide how to assign kanbans to products. With a fixed total number of kanbans in a competitive environment, the goal is to determine their allocation to product types in order to minimize lost sales equitably. In particular, we consider systems in which the products may make multiple visits to the same station with a different processing time distribution on each repeat visit. With a fixed number of kanbans dedicated to each product, the system is modeled as a multiple chain multiple class closed queuing network. A nonlinear program simultaneously provides an approximate performance evaluation and optimizes the allocation of kanbans to product types. In numerical examples, the allocations identified are similar to those obtained by exhaustive enumeration with simulation but frequently differ significantly from a naïve allocation according to demand rates. A variant of the model that minimizes the total workinprocess to achieve specified throughput targets yields results similar to a previous heuristic method.
S. M. Ryan* and J. Vorasayan
"... To operate a multiple product manufacturing system under a CONWIP control policy, one must decide how to assign kanbans to products. With a fixed total number of kanbans in a competitive environment, the goal is to determine their allocation to product types in order to minimize lost sales equitably ..."
Abstract
 Add to MetaCart
To operate a multiple product manufacturing system under a CONWIP control policy, one must decide how to assign kanbans to products. With a fixed total number of kanbans in a competitive environment, the goal is to determine their allocation to product types in order to minimize lost sales equitably. In particular, we consider systems in which the products may make multiple visits to the same station with a different processing time distribution on each repeat visit. With a fixed number of kanbans dedicated to each product, the system is modeled as a multiple chain multiple class closed queuing network. A nonlinear program simultaneously provides an approximate performance evaluation and optimizes the allocation of kanbans to product types. In numerical examples, the allocations identified are similar to those obtained by exhaustive enumeration with simulation. A variant of the model that minimizes the total workinprocess to achieve specified throughput targets yields results similar to a previous heuristic method.
Analysis of MultiClass Queueing Systems with Finite Buffers and Setup Times Using Decomposition Methods
"... In this paper, we consider two variants of a multiclass queueing system with a single server, finite buffers, and setup times. In the first variant, a setup occurs every time the server turns to a different class of customers, even if the queue of the scanned customer class is empty. In the second ..."
Abstract
 Add to MetaCart
In this paper, we consider two variants of a multiclass queueing system with a single server, finite buffers, and setup times. In the first variant, a setup occurs every time the server turns to a different class of customers, even if the queue of the scanned customer class is empty. In the second variant, the server skips empty queues and a setup is performed only at queues that contain at least one customer. We propose decomposition methods for the analysis of the steadystate behavior of both system variants. We also show that multiproduct kanban systems with setup times and lost sales are possible applications of the discussed models and we give numerical results that indicate the accuracy of the proposed approximation methods. Keywords:
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
(Show Context)
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 is the construction of a production plan for the machine that minimizes the total costs, i.e., the sum of holding, backlogging and setup costs. Based on the critical elements of such a production plan, we give a classification and extensive overview of the research on the SELSP together with an indication of open research areas.