Matematik ve Bilgisayar Bölümü Tezleri

Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/222

Browse

Browsing Matematik ve Bilgisayar Bölümü Tezleri by Author "Akdoğan, Şahika"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Item
    Citation Count: Akdoğan, Şahika (2017). Mathematical models and heuristic algorithms for a multi-product lot streaming problem in a two-machine flowshop / İki makineli akış tipi atölyede çok ürünlü kafile bölme ve kaydırma problemi için matematiksel modeller ve sezgisel algoritmalar. Yayımlanmış yüksek lisans tezi. Ankara: Çankaya Üniversitesi Fen Bilimleri Enstitüsü.
    Mathematical models and heuristic algorithms for a multi-product lot streaming problem in a two-machine flowshop
    (Çankaya Üniversitesi, 2017) Akdoğan, Şahika; Çankaya Üniveristesi, Fen Bilimleri Enstitüsü, Matematik Bilgisayar Anabilim Dalı
    In this study, we consider a multi-product lot streaming problem to minimize the makespan on a two-machine flowshop environment in which all product lots are processed by Machine 1 and then by Machine 2. Most of the current studies in the literature of the multi-product lot streaming problem assume that the number of sublots for each product is known in advance, and determines the size for each sublot of every product and the sequence of sublots of all products. However, in our study we assume that the total number of sublots for all products is known advance, although the number of sublots for each product is not known in advance. Our problem is to determine the number of sublots for each product, the size of each sublot and the sequence of sublots that gives the minimum makespan. We investigate this multi-product lot streaming problem for two cases in which sublots of each product are equal sized in the first case while sublots of each product are unequal sized in the second case. We develop mixed integer linear mathematical models and heuristic algorithms for solving each case. We compare these solutions of mathematical models and heuristic algorithm. We design computational experiments to evaluate the performance of our solutions approaches in terms of makespan time. The results show that the mixed integer programming models do not seem to be a useful alternative, especially for large scale problem instances. However, our proposed heuristic algorithms find optimal or near-optimal solutions in very short time