Browsing by Author "Oner, Adalet"

Now showing 1 - 6 of 6

Citation - WoS: 82
Citation - Scopus: 103
A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
(ELSEVIER SCIENCE INC, 2013) M. Fatih Tasgetiren; Quan-Ke Pan; P. N. Suganthan; Adalet Oner; Suganthan, P.N.; Tasgetiren, M. Fatih; Fatih Tasgetiren, M.; Oner, Adalet; Pan, Quan-Ke
In this paper we present a discrete artificial bee colony algorithm to solve the no-idle permutation flowshop scheduling problem with the total tardiness criterion. The no-idle permutation flowshop problem is a variant of the well-known permutation flowshop scheduling problem where idle time is not allowed on machines. In other words the start time of processing the first job on a given machine must be delayed in order to satisfy the no-idle constraint. The paper presents the following contributions: First of all a discrete artificial bee colony algorithm is presented to solve the problem on hand first time in the literature. Secondly some novel methods of calculating the total tardiness from make-span are introduced for the no-idle permutation flowshop scheduling problem. Finally the main contribution of the paper is due to the fact that a novel speed-up method for the insertion neighborhood is developed for the total tardiness criterion. The performance of the discrete artificial bee colony algorithm is evaluated against a traditional genetic algorithm. The computational results show its highly competitive performance when compared to the genetic algorithm. Ultimately we provide the best known solutions for the total tardiness criterion with different due date tightness levels for the first time in the literature for the Taillard's benchmark suit. (C) 2013 Elsevier Inc. All rights reserved.
Analysis and balancing of assembly line in a machine molding factory
(2021) Esra CAN; ADALET ONER; Can, Esra; Oner, Adalet
In industrialization to be able to make cheap and fast production assembly lines are one of the most basic elements in serial production systems. It is important to balance the assembly line to continue production smoothly. By assembly line balancing is created each work step is grouped stations are created and each station time is brought close to the station cycle times. In this study a refrigerator top panel pressing line is analysed. The study’s aim is balancing the line for increase production rate. Firstly the line is observed and some studies are planned. A time study is done to analyse the current situation of the line. Time study data are calculated by using Excel. Ranked Positional Weight Method is used as an intuitive method for single model U type assembly line balancing problem and mathematical modelling method is applied. The methods are used to balance the line using time study data. The solution of mathematical modelling is obtained by using Lingo. Results are compared and they are observed that results have almost the same. In conclusion an assembly line balancing problem is mentioned in this study. Various programs related to the applied methods were used and the data obtained as a result of current and final calculations were compared. First and last calculations and results are verified with each other. It was seen that the data obtained as a result of the study provided improvement.
Citation - WoS: 5
Citation - Scopus: 5
Continuous Time MILP Models for Multi-Mode Resource Constrained Project Scheduling Problems
(IEEE, 2020) Guler Ozturk; Adalet Oner; Ozturk, Guler; Oner, Adalet
Two new continuous-time MILP (Mixed Integer Linear Programming) models are developed for resource constrained project scheduling problems in which activities can be conducted in different (multi) modes. There are efficient and flexible MILP models for this problem in which time is represented by a number of discrete time intervals. However they require to use large numbers of binary variables as the number of activities increases and time horizon stretches. Hence efforts have been made to formulate MILP models based on continuous-time representation and therefore to speed up the solution process. We propose two novel MILP models based on the event and resource flow concepts. The models are verified by solving benchmark problems in the literature.
Citation - WoS: 10
Citation - Scopus: 17
Optimization of university course scheduling problem with a hybrid artificial bee colony algorithm
(IEEE, 2011) Adalet Oner; Sel Ozcan; Derya Dengi; Dengi, Derya; Oner, Adalet; Ozcan, Sel
Course scheduling problem (CSP) is concerned with developing a timetable that illustrates a number of courses assigned to the classrooms. In this study a hybrid algorithm composed of a heuristic graph node coloring (GNC) algorithm and artificial bee colony (ABC) algorithm is proposed to solve CSP. The study is one of the few applications of ABC on discrete optimization problems and to our best knowledge it is the first application on CSP. A basic heuristic algorithm of node coloring problem takes part initially to develop some feasible solutions of CSP. Those feasible solutions correspond to the food sources in ABC algorithm. The ABC is then is used to improve the feasible solutions. The employed and onlooker bees are directed or controlled in a specific manner in order to avoid the conflicts in the course timetable. Proposed solution procedure is tested using real data from a university in Turkey. The experimental results demonstrate that the proposed hybrid algorithm yields efficient solutions. © 2011 IEEE. © 2011 Elsevier B.V. All rights reserved.
Citation - WoS: 1
Simulation and Analysis of Izmir’s Metro Transportation System
(Crc Press-Taylor & Francis Group, 2015) Ozturk, Guler; Oner, Adalet
The Review of Variants and Extensions of Multi-mode Resource Constrained Problems
(Springer Science and Business Media Deutschland GmbH, 2025) Guler Ozturk Gorgulu; Adalet Oner; Gorgulu, Guler Ozturk; Oner, Adalet; A. Swaroop , B. Virdee , S.D. Correia , Z. Polkowski
Exploring the diverse extensions of the Resource-Constrained Project Scheduling Problem (RCPSP) this survey emphasizes the multi-mode variants an area that has seen significant interest. RCPSP a well-established problem in project scheduling focuses on optimizing activity schedules under precedence and resource constraints. Despite its prevalence in research the foundational RCPSP model’s restrictive assumptions often fall short in complex practical applications. Addressing these gaps the overview delves into the various developed extensions of the basic RCPSP framework. Classifications are made according to key structural aspects: Enhancements in activity concepts and broader interpretations of resource constraints. Additionally libraries that contain multi-mode RCPSP benchmark instances are explained in detail. Particular attention is given to multi-mode extensions of RCPSP. The objective is to present a detailed current perspective on multi-mode extensions in RCPSP. © 2025 Elsevier B.V. All rights reserved.