01.06.2013 Views

Ayrıntılı Bilimsel Program ve Bildiri Özetleri - YAEM2010

Ayrıntılı Bilimsel Program ve Bildiri Özetleri - YAEM2010

Ayrıntılı Bilimsel Program ve Bildiri Özetleri - YAEM2010

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

YAEM 2010<br />

YÖNEYLEM ARAÞTIRMASI VE ENDÜSTRÝ MÜHENDÝSLÝGI 30. ULUSAL KONGRESÝ<br />

Capacitated lot sizing problem with setup carryo<strong>ve</strong>r deals with<br />

multiple products produced on a single machine. A setup is assumed<br />

to be carried o<strong>ve</strong>r from one period to the next and the partial<br />

sequencing of the first and last product is incorporated. When the<br />

demand of a period cannot be satisfied, it is backordered. In this<br />

study, a heuristic hybrid approach combining Genetic Algorithms<br />

(GAs) and Fix-and-Optimize heuristic is proposed to sol<strong>ve</strong> the<br />

capacitated lot sizing problem with set-up carryo<strong>ve</strong>r and<br />

backordering. The first phase of the study invol<strong>ve</strong>s optimizing the<br />

control parameters such as the combination of the population size and<br />

the number of generations, rate of crosso<strong>ve</strong>r and rate of mutation.<br />

Next, the performance of the proposed hybrid approach is compared<br />

to the pure GAs using various problem instances.<br />

Periodic Capacity Management under a Lead Time Performance<br />

Constraint<br />

Nasuh Cagdas Buyukkaramikli<br />

Department of Industrial Engineering and Innovation Sciences, TU/e,<br />

Eindho<strong>ve</strong>n, Hollanda<br />

In this paper, we study a production system that operates under a<br />

lead time performance constraint which guarantees the completion of<br />

a job order before a pre-determined lead time<br />

with a certain probability. The demand arrival times and service<br />

requirements for the jobs are random. In order to reduce capacity<br />

related costs, system decides to use flexible capacity policies. Most of<br />

the flexible capacity practices in real life are inherently periodic due to<br />

se<strong>ve</strong>ral reasons. Motivated by this observation, we focus on periodic<br />

capacity policies and model the production system as a queuing<br />

system that changes its service rate periodically. We assume two<br />

le<strong>ve</strong>ls of capacity available: permanent and contingent capacity le<strong>ve</strong>ls.<br />

The contingent capacity is supplied if needed at the start of a period,<br />

and is available during that period, at a cost rate that decreases in<br />

period length. We de<strong>ve</strong>lop a procedure to create a set for candidate<br />

period lengths and permanent/contingent capacity le<strong>ve</strong>ls and search<br />

for the capacity le<strong>ve</strong>ls and the threshold point that minimizes the<br />

capacity related costs for a gi<strong>ve</strong>n period length.<br />

1160

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!