Bilgilendirme: Kurulum ve veri kapsamındaki çalışmalar devam etmektedir. Göstereceğiniz anlayış için teşekkür ederiz.
 

Soysal, Serdar

Profile Picture
Profile URL
https://hdl.handle.net/20.500.12416/9234
Name Variants
Job Title
Arş. Gör.
Email Address
sersoysal@cankaya.edu.tr
Main Affiliation
Endüstri Mühendisliği
Status
Former Staff
Website
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID

Sustainable Development Goals

SDG data is not available
This researcher does not have a Scopus ID.
This researcher does not have a WoS ID.
Scholarly Output

1

Articles

0

Views / Downloads

612/1131

Supervised MSc Theses

1

Supervised PhD Theses

0

WoS Citation Count

0

Scopus Citation Count

0

WoS h-index

0

Scopus h-index

0

Patents

0

Projects

0

WoS Citations per Publication

0.00

Scopus Citations per Publication

0.00

Open Access Source

1

Supervised Theses

1

Google Analytics Visitor Traffic

Journals data is not available

Scopus Quartile Distribution

Quartile distribution chart data is not available

Competency Cloud

GCRIS Competency Cloud

Filters

20081
Reset filters

Settings

Scholarly Output Search Results

Now showing 1 - 1 of 1
  • Thumbnail Image
    Master Thesis
    Scheduling in a three-stage dedicated hybrid flowshop with a common third-stage
    (2008) Soysal, Serdar
    In this study, we consider a scheduling problem of a manufacturing environment in which there are two manufacturing flow lines, where the third stage of the first line and the second stage of the second line are common. Each stage in the first flow line has a single machine whereas the second flow line contains two identical parallel machines in its first stage. Type-1 jobs are processed in the first flow line, whereas second flow line is dedicated to type-2 jobs. The last operation, of both types of jobs, must be processed on a common machine. The problem is to determine the sequence and schedule of all jobs at all stages of the two flow lines so that the makespan is minimized. We develop a mathematical model and a branch-and-bound algorithm with lower and upper bounding procedures to find optimal solution; we propose heuristic algorithms which provide good quality solutions at little computational effort when the computational effort to obtain an exact solution is prohibitive. The effectiveness of our solution approaches are demonstrated by computational analyses.