Tunalı, Semra

Profile Picture
Profile URL
https://hdl.handle.net/20.500.14365/7045
Name Variants
Tunali, S
TUNALI, S
Tunali, Semra
Job Title
Email Address
semra.tunali@ieu.edu.tr
Main Affiliation
03.02. Business Administration
Status
Current Staff
Website
ORCID ID
0000-0002-4172-6479
Scopus Author ID
7004191746
Turkish CoHE Profile ID
BA7D86605059A18F
Google Scholar ID
nEYOdI4AAAAJ
WoS Researcher ID
AAM-5058-2021
Files
SemraTunali.jpg (5.06 KB)

Sustainable Development Goals

5

GENDER EQUALITY
GENDER EQUALITY Logo

0

Research Products

9

INDUSTRY, INNOVATION AND INFRASTRUCTURE
INDUSTRY, INNOVATION AND INFRASTRUCTURE Logo

5

Research Products

13

CLIMATE ACTION
CLIMATE ACTION Logo

0

Research Products

8

DECENT WORK AND ECONOMIC GROWTH
DECENT WORK AND ECONOMIC GROWTH Logo

0

Research Products

14

LIFE BELOW WATER
LIFE BELOW WATER Logo

0

Research Products

17

PARTNERSHIPS FOR THE GOALS
PARTNERSHIPS FOR THE GOALS Logo

0

Research Products

1

NO POVERTY
NO POVERTY Logo

0

Research Products

2

ZERO HUNGER
ZERO HUNGER Logo

0

Research Products

4

QUALITY EDUCATION
QUALITY EDUCATION Logo

0

Research Products

11

SUSTAINABLE CITIES AND COMMUNITIES
SUSTAINABLE CITIES AND COMMUNITIES Logo

0

Research Products

16

PEACE, JUSTICE AND STRONG INSTITUTIONS
PEACE, JUSTICE AND STRONG INSTITUTIONS Logo

0

Research Products

3

GOOD HEALTH AND WELL-BEING
GOOD HEALTH AND WELL-BEING Logo

0

Research Products

6

CLEAN WATER AND SANITATION
CLEAN WATER AND SANITATION Logo

0

Research Products

12

RESPONSIBLE CONSUMPTION AND PRODUCTION
RESPONSIBLE CONSUMPTION AND PRODUCTION Logo

0

Research Products

10

REDUCED INEQUALITIES
REDUCED INEQUALITIES Logo

0

Research Products

15

LIFE ON LAND
LIFE ON LAND Logo

0

Research Products

7

AFFORDABLE AND CLEAN ENERGY
AFFORDABLE AND CLEAN ENERGY Logo

0

Research Products
Documents

41

Citations

969

h-index

16

Go to Scopus profile
Documents

25

Citations

773

Go to WoS profile
Scholarly Output

24

Articles

17

Views / Downloads

6/638

Supervised MSc Theses

0

Supervised PhD Theses

1

WoS Citation Count

405

Scopus Citation Count

524

WoS h-index

12

Scopus h-index

12

Patents

0

Projects

0

WoS Citations per Publication

16.88

Scopus Citations per Publication

21.83

Open Access Source

2

Supervised Theses

1

JournalCount
IFAC Proceedings Volumes (IFAC-PapersOnline)3
Internatıonal Journal of Productıon Research2
24th Mini EURO Conference on Continuous Optimization and Information-Based Technologies in the Financial Sector, MEC EurOPT 20102
Computers & Operatıons Research2
Engıneerıng Optımızatıon2
Current Page: 1 / 4

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud

Filters

2010 - 2019222020 - 20251
Reset filters

Settings

Scholarly Output Search Results

Now showing 1 - 10 of 23
  • Thumbnail Image
    Article
    Citation - Scopus: 17
    Simultaneous Balancing and Scheduling of Flexible Mixed Model Assembly Lines With Sequence-Dependent Setup Times
    (2010) Ozturk, Cemalettin; Tunali S.; Hnich B.; Örnek, Mustafa Arslan
    We consider Simultaneous Balancing and Scheduling of Flexible Mixed Model Assembly Lines with Sequence-Dependent Setup Times (SBSFMMAL-SDST). We propose alternate Mixed Integer Programming (MIP) and Constraint Programming (CP) formulations. Our experiments show that while the MIP models could not solve relatively small instances, the CP approach seems more promising. © 2010.
  • Thumbnail Image
    Article
    Citation - WoS: 4
    Fix-And Heuristics for Capacitated Lot Sizing With Setup Carryover and Backordering
    (Emerald Group Publishing Ltd, 2018) Goren, Hacer Guner; Tunali, Semra
    Purpose The capacitated lot sizing problem (CLSP) is one of the most important production planning problems which has been widely studied in lot sizing literature. The CLSP is the extension of the Wagner-Whitin problem where there is one product and no capacity constraints. The CLSP involves determining lot sizes for multiple products on a single machine with limited capacity that may change for each planning period. Determining the right lot sizes has a critical importance on the productivity and success of organizations. The paper aims to discuss these issues. Design/methodology/approach This study focuses on the CLSP with setup carryover and backordering. The literature focusing on this problem is rather limited. To fill this gap, a number of problem-specific heuristics have been integrated with fix-and-optimize (FOPT) heuristic in this study. The authors have compared the performances of the proposed approaches to that of the commercial solver and recent results in literature. The obtained results have stated that the proposed approaches are efficient in solving this problem. Findings The computational experiments have shown that the proposed approaches are efficient in solving this problem. Originality/value To address the solution of the CLSP with setup carryover and backordering, a number of heuristic approaches consisting of FOPT heuristic are proposed in this paper.
  • Thumbnail Image
    Review Article
    Citation - WoS: 23
    Citation - Scopus: 28
    A Review of the Current Applications of Genetic Algorithms in Mixed-Model Assembly Line Sequencing
    (Taylor & Francis Ltd, 2011) Akgunduz, Onur Serkan; Tunali, Semra
    A mixed-model assembly line (MMAL) is a type of production line which is capable of producing a variety of different product models simultaneously and continuously. The design and planning of such assembly lines involves several long-and short-term problems. Among these problems, determining the sequence of products to be produced has received considerable attention from the researchers. This problem is known as the Mixed-Model Assembly Line Sequencing Problem (MMALSP). An important issue that complicates the sequencing problem is its combinatorial nature. Typically, an enormous number of possible production sequences exist, even for relatively small problems, so that finding the optimal solution is usually impractical. Due to the complexity of the problem, in recent years, a growing number of researchers have employed genetic algorithms (GAs). This paper reviews the genetic algorithm based MMAL sequencing approaches presented in the literature and provides two hierarchical classification schemes to classify academic efforts according to both specifications of MMALSP and specifications of GA-based approaches. Moreover, future research directions have been identified and are suggested.
  • Thumbnail Image
    Conference Object
    Citation - Scopus: 2
    Cyclic Scheduling of Flexible Mixed Model Assembly Lines
    (IFAC Secretariat, 2013) Ozturk, Cemalettin; Tunali S.; Hnich B.; Örnek, Mustafa Arslan
    Mixed model assembly lines are used to produce multiple copies of given minimum part set (MPS). Considering only one copy (cycle) of the MPS while solving the mixed-model balancing and scheduling problem yields suboptimal solutions since blocking and idle times of stations between repeated copies are ignored. Modeling and solving this problem in a cyclic manner can significantly overcome these inefficiencies and improve the throughput of the line. In this paper, after investigating the nature of the problem, we propose exact and heuristic methods for practical applications and evaluate their performances on various size test instances. © IFAC.
  • Thumbnail Image
    Article
    Citation - WoS: 44
    Citation - Scopus: 52
    A Tabu Search Approach for Buffer Allocation in Production Lines With Unreliable Machines
    (Taylor & Francis Ltd, 2011) Demir, Leyla; Tunali, Semra; Lokketangen, Arne
    The optimal allocation of buffers is an important research issue in designing production lines. In this study, a tabu search (TS) algorithm is proposed to find near-optimal buffer allocation plans for a serial production line with unreliable machines. The main objective is to maximize the production rate, i.e. throughput, of the line. The efficiency of the proposed method is also tested to solve buffer allocation problems with the objective of total buffer size minimization. To estimate the throughput of the line with a given specific buffer allocation, an analytical decomposition approximation method is used. The performance of the tabu search algorithm is demonstrated on existing benchmark problems. The results obtained by the TS algorithm are clearly encouraging, as the TS algorithm is much better than the other algorithms for all considered benchmark problems.
  • Thumbnail Image
    Article
    Citation - WoS: 45
    Citation - Scopus: 56
    An Adaptive Tabu Search Approach for Buffer Allocation Problem in Unreliable Non-Homogenous Production Lines
    (Pergamon-Elsevier Science Ltd, 2012) Demir, Leyla; Tunali, Semra; Eliiyi Türsel, Deniz
    The buffer allocation problem, i.e. how much buffer storage to allow and where to place it within the line, is an important research issue in designing production lines. In this study, a novel adaptive tabu search approach is proposed for solving buffer allocation problem in unreliable and non-homogeneous production lines. The objective is to maximize the throughput of the line, which is constrained by the capacity of each buffer space and also the total buffer capacity to allocate to these spaces. Besides proposing a new strategy to tune the parameters of tabu search adaptively during the search, an experimental study is carried out to select an intelligent initial solution scheme among three alternatives so as to decrease the search effort to obtain the best solutions. The performance of the proposed approach is evaluated by computational tests and very promising results are obtained. (C) 2011 Elsevier Ltd. All rights reserved.
  • Thumbnail Image
    Article
    Citation - WoS: 12
    Citation - Scopus: 16
    Setting Order Promising Times in a Supply Chain Network Using Hybrid Simulation-Analytical Approach: an Industrial Case Study
    (Elsevier, 2011) Tunali, Semra; Ozfirat, Pinar Mizrak; Ay, Gulay
    Supply chain management (SCM) involves the management of material and information flow among the members of chain such as vendors, manufacturing plants and distribution centers. The main processes in supply chain are production planning, control, distribution and logistics. Effective management of all these processes provides the manufacturing companies great advantages in time based competition. In order to gain a competitive edge, firms must be able to deliver their products fast and on-time. This can be managed by better production planning, scheduling and due-date setting. This paper suggests a hybrid approach for setting realistic order due dates for a produce-to-order manufacturing company operating within a supply chain environment. The proposed hybrid approach combines mathematical and simulation modeling to bring together the advantages of both approaches. (C) 2011 Elsevier B. V. All rights reserved.
  • Thumbnail Image
    Conference Object
    Citation - Scopus: 4
    A Comparison of Three Search Algorithms for Solving the Buffer Allocation Problem in Reliable Production Lines
    (IFAC Secretariat, 2013) Demir L.; Diamantidis A.; Eliiyi Türsel, Deniz; O'Kelly M.E.J.; Papadopoulos C.T.; Tsadiras A.K.; Tunali S.
    This paper investigates the performance of three search algorithms: Myopic Algorithm, Adaptive Tabu Search and Degraded Ceiling to solve the buffer allocation problem in reliable production lines. DECO algorithm is used to calculate throughput. This algorithm is a variant of a decomposition algorithm specifically developed to solve large reliable production lines with parallel machines at each workstation and exponentially distributed service times. The measures of performance used are the CPU time required and closeness to the maximum throughput achieved. The three search algorithms are ranked in respect to these two measures and certain findings regarding their performances over the experimental set are given. © IFAC.
  • Thumbnail Image
    Article
    Citation - WoS: 19
    Citation - Scopus: 24
    Balancing and Scheduling of Flexible Mixed Model Assembly Lines With Parallel Stations
    (Springer London Ltd, 2013) Ozturk, Cemalettin; Tunali, Semra; Hnich B.; Örnek, Mustafa Arslan
    In this paper, we study flexible mixed model assembly lines with serially connected stages where stages may have one or more parallel stations. Station parallelism in flexible mixed model assembly lines improves system reliability and enables rapid adaptability to customer demand fluctuations. However, in order to effectively manage such lines under real-world conditions, there is a need to extend traditional assembly line management methods. This study extends the current research by simultaneously considering the problems of task assignment and model scheduling on parallel stations. Furthermore, scheduling of assigned tasks on each station is considered. We formulate the problem context first as a mixed integer programming model and then develop a decomposition scheme for large scale applications. Finally, we compare the performance of the proposed model and decomposition scheme using various size test instances.
  • Thumbnail Image
    Conference Object
    Citation - Scopus: 2
    Simultaneous Balancing and Scheduling of Flexible Mixed Model Assembly Lines With Sequence Dependent Task Time Increments
    (Vilnius Gediminas Technical University, 2010) Ozturk, Cemalettin; Tunali S.; Hnich B.; Örnek, Mustafa Arslan
    General tendency in mixed model assembly line literature is to separate balancing and model sequencing decisions to different time frames. However, today's competitive market conditions force decision makers to respond quickly to changing demand patterns. Therefore, assembly line balancing and mixed model sequencing problems should be considered together. In this paper, we state the problem structure with sequence dependent task time increments and flexibility in task assignment. Furthermore, we compare the performance of two approaches which are proposed to solve the stated problem by using various problem instances. © Izmir University of Economics, Turkey, 2010.