Results 1 
7 of
7
A Genetic AlgorithmBased Decision Support System for Allocating International Apparel Demand
"... Abstract: It has become more and more important and difficult to minimize makespan in the global competitive markets. The purpose of this paper is to develop a decision support system to assist managers in making decisions for minimal makespan. There are too many and complex factors for senior mana ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Abstract: It has become more and more important and difficult to minimize makespan in the global competitive markets. The purpose of this paper is to develop a decision support system to assist managers in making decisions for minimal makespan. There are too many and complex factors for senior managers to make suitable decisions. By traditional methods to allocate orders for minimum makespan, it often makes unfit decisions. Thus, we used genetic algorithm for analyzing complex data. After calculating by genetic algorithm and firstinfirstout (FIFO), the result shows that allotting orders by genetic algorithm could cause better outcomes.
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.
unknown title
, 2007
"... We discuss a singleserver multistation alternating queue where the preparation times and the service times are auto and crosscorrelated. We examine two cases. In the first case, preparation and service times depend on a common discrete time Markov chain. In the second case, we assume that the se ..."
Abstract
 Add to MetaCart
(Show Context)
We discuss a singleserver multistation alternating queue where the preparation times and the service times are auto and crosscorrelated. We examine two cases. In the first case, preparation and service times depend on a common discrete time Markov chain. In the second case, we assume that the service times depend on the previous preparation time through their joint Laplace transform. The waiting time process is directly analysed by solving a Lindleytype equation via transform methods. Numerical examples are included to demonstrate the effect of the autocorrelation of and the crosscorrelation between the preparation and service times. 1
unknown title
, 2007
"... We discuss a singleserver multistation alternating queue where the preparation times and the service times are auto and crosscorrelated. We examine two cases. In the first case, preparation and service times depend on a common discrete time Markov chain. In the second case, we assume that the se ..."
Abstract
 Add to MetaCart
(Show Context)
We discuss a singleserver multistation alternating queue where the preparation times and the service times are auto and crosscorrelated. We examine two cases. In the first case, preparation and service times depend on a common discrete time Markov chain. In the second case, we assume that the service times depend on the previous preparation time through their joint Laplace transform. The waiting time process is directly analysed by solving a Lindleytype equation via transform methods. Numerical examples are included to demonstrate the effect of the autocorrelation of and the crosscorrelation between the preparation and service times. 1
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.
Lead Time Minimization of MultiProduct, SingleProcessor System: A Comparison of Cyclic Policies
, 2005
"... Lead time minimization of a multiproduct, singleprocessor system: A comparison of cyclic policies ..."
Abstract
 Add to MetaCart
Lead time minimization of a multiproduct, singleprocessor system: A comparison of cyclic policies
unknown title
, 2007
"... A twostation queue with dependent preparation and service times ..."
(Show Context)