Çankaya GCRIS Standart veritabanının içerik oluşturulması ve kurulumu Research Ecosystems (https://www.researchecosystems.com) tarafından devam etmektedir. Bu süreçte gördüğünüz verilerde eksikler olabilir.

Endüstri Mühendisliği Bölümü

Permanent URI for this communityhttps://hdl.handle.net/20.500.12416/16

Browse

Browsing Endüstri Mühendisliği Bölümü by Author "1986"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    Article
    Citation Count: Hazır, Ö., Günalay, Y., Erel, E. (2008). Customer order scheduling problem: a comparative metaheuristics study. International Journal of Advanced Manufacturing Technology, 37(5-6), 589-598. http://dx.doi.org/10.1007/s00170-007-0998-8
    Customer order scheduling problem: a comparative metaheuristics study
    (Springer London Ltd, 2008) Hazır, Öncü; Günalay, Yavuz; Erel, Erdal; 56488; 3019; 1986
    The customer order scheduling problem (COSP) is defined as to determine the sequence of tasks to satisfy the demand of customers who order several types of products produced on a single machine. A setup is required whenever a product type is launched. The objective of the scheduling problem is to minimize the average customer order flow time. Since the customer order scheduling problem is known to be strongly NP-hard, we solve it using four major metaheuristics and compare the performance of these heuristics, namely, simulated annealing, genetic algorithms, tabu search, and ant colony optimization. These are selected to represent various characteristics of metaheuristics: nature-inspired vs. artificially created, population-based vs. local search, etc. A set of problems is generated to compare the solution quality and computational efforts of these heuristics. Results of the experimentation show that tabu search and ant colony perform better for large problems whereas simulated annealing performs best in small-size problems. Some conclusions are also drawn on the interactions between various problem parameters and the performance of the heuristics
  • Thumbnail Image
    Article
    Citation Count: Hazır, Ö., Haouari, M., Erel, E. (2010). Discrete time/cost trade-off problem: A decomposition-based solution algorithm for the budget version. Computer & Operations Research, 37(4), 649-655. http://dx.doi.org/10.1016/j.cor.2009.06.009
    Discrete time/cost trade-off problem: A decomposition-based solution algorithm for the budget version
    (Pergamon-Elsevier Science, 2010) Hazır, Öncü; Haouari, Mohamed; Erel, Erdal; 56488; 1986
    This paper investigates the budget variant of the discrete time/cost trade-off problem (DTCTP). This multi-mode project scheduling problem requires assigning modes to the activities of a project so that the total completion time is minimized and the budget and the precedence constraints are satisfied. This problem is often encountered in practice as timely completion of the projects without exceeding the budget is crucial. The contribution of this paper to the literatures is to describe an effective Benders Decomposition-based exact algorithm to solve the DTCTP instances of realistic sizes. Although Benders Decomposition often exhibits a very slow convergence, we have included several algorithmic features to enhance the performance of the proposed tailored approach. Computational results attest to the efficacy of the proposed algorithm, which can solve large-scale instances to optimality.