• Türkçe
    • English
  • English 
    • Türkçe
    • English
  • Login
Search 
  •   DSpace Home
  • Search
  •   DSpace Home
  • Search
JavaScript is disabled for your browser. Some features of this site may not work without it.

Search

Show Advanced FiltersHide Advanced Filters

Filters

Use filters to refine the search results.

Now showing items 31-40 of 103

  • Sort Options:
  • Relevance
  • Title Asc
  • Title Desc
  • Issue Date Asc
  • Issue Date Desc
  • Results Per Page:
  • 5
  • 10
  • 20
  • 40
  • 60
  • 80
  • 100
Thumbnail

A local-best harmony search algorithm with dynamic subpopulations 

Pan, Q.K.; Suganthan, P.N.; Liang, J.J.; Tasgetiren, M.F. (Engineering Optimization, 2010)
This article presents a local-best harmony search algorithm with dynamic subpopulations (DLHS) for solving the bound-constrained continuous optimization problems. Unlike existing harmony search algorithms, the DLHS algorithm ...
Thumbnail

An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem 

Tasgetiren, M.F.; Suganthan, P.N.; Pan, Q.K. (Applied Mathematics and Computation, 2010)
In this paper, an ensemble of discrete differential evolution algorithms with parallel populations is presented. In a single populated discrete differential evolution (DDE) algorithm, the destruction and construction (DC) ...
Thumbnail

Minimizing the total flow time in a flow shop with blocking by using hybridm harmony search algorithms 

Wang, L.; Pan, Q.K.; Tasgetiren, M.F. (Expert Systems with Applications, 2010)
In this paper, three hybrid harmony search (HS) algorithms, namely, hybrid harmony search (hHS) algorithm, hybrid globalbest harmony search (hgHS) algorithm and hybrid modified globalbest harmony search (hmgHS) algorithm, ...
Thumbnail

An energy-efficient permutation flowshop scheduling problem 

Oztop, H.; Tasgetiren, M.F.; Tursel Eliiyi, D.; Pan, Q.K.; Kandiller, L. (PERGAMON-ELSEVIER SCIENCE LTD, 2020)
The permutation flowshop scheduling problem (PFSP) has been extensively explored in scheduling literature because it has many real-world industrial implementations. In some studies, multiple objectives related to production ...
Thumbnail

An Effective Discrete Artificial Bee Colony Algorithm for Scheduling an Automatic-Guided-Vehicle in a Linear Manufacturing Workshop 

Zou, W.Q.; Pan, Q.K.; Tasgetiren, M.F. (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2020)
This paper deals with a new automatic guided vehicle (AGV) scheduling problem from the material handling process in a linear manufacturing workshop. The problem is to determine a sequence of Cells for AGV to travel to ...
Thumbnail

Metaheuristic algorithms for the hybrid flowshop scheduling problem 

Oztop, H.; Tasgetiren, M.F.; Tursel Eliiyi, D.; Pan, Q.K. (PERGAMON-ELSEVIER SCIENCE LTD, 2019)
The hybrid flowshop scheduling problem (HFSP) has been widely studied in the literature, as it has many real-life applications in industry. Even though many solution approaches have been presented for the HFSP with makespan ...
Thumbnail

A Variable Block Insertion Heuristic for Solving Permutation Flow Shop Scheduling Problem with Makespan Criterion 

Kizilay, D.; Tasgetiren, M.F.; Pan, Q.K.; Gao, L. (MDPI, 2019)
In this paper, we propose a variable block insertion heuristic (VBIH) algorithm to solve the permutation flow shop scheduling problem (PFSP). The VBIH algorithm removes a block of jobs from the current solution. It applies ...
Thumbnail

Energy-Efficient Single Machine Total Weighted Tardiness Problem with Sequence-Dependent Setup Times 

Tasgetiren, M.F.; Oztop, H.F.; Eliiyi, U.; Tursel Eliiyi, D.; Pan, Q.K. (SPRINGER INTERNATIONAL PUBLISHING AG, 2018)
Most of the problems defined in the scheduling literature do not yet take into account the energy consumption of manufacturing processes, as in most of the variants with tardiness objectives. This study handles scheduling ...
Thumbnail

Green Permutation Flowshop Scheduling: A Trade- off- Between Energy Consumption and Total Flow Time 

Oztop, H.; Tasgetiren, M.F.; Tursel Eliiyi, D.; Pan, Q.K. (SPRINGER INTERNATIONAL PUBLISHING AG, 2018)
Permutation flow shop scheduling problem (PFSP) is a well-known problem in the scheduling literature. Even though many multi-objective PFSPs are presented in the literature with the objectives related to production efficiency ...
Thumbnail

Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion 

Tasgetiren, M.F.; Kizilay, D.; Pan, Q.K.; Suganthan, P.N. (PERGAMON-ELSEVIER SCIENCE LTD, 2017)
Recently, iterated greedy algorithms have been successfully applied to solve a variety of combinatorial optimization problems. This paper presents iterated greedy algorithms for solving the blocking flowshop scheduling ...
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • . . .
  • 11





Creative Commons License
[email protected] by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..

DSpace software copyright © 2002-2016  DuraSpace
Contact Us | Send Feedback
Theme by 
Atmire NV
 

 




| Politika | Rehber | İletişim |

sherpa/romeo

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsBy TypeBy PublisherBy Language

My Account

LoginRegister

Discover

Author
Pan, Q.K. (103)
Tasgetiren, M.F. (103)Suganthan, P.N. (50)Kizilay, D. (15)Gao, K.Z. (9)Tursel Eliiyi, D. (9)Chen, A.H.L. (8)Oztop, H. (8)Wang, L. (8)Buyukdagli, O. (6)... View MoreSubjectTotal flowtime (2)Distributed mixed no-idle flowshop (1)Distributed permutation flowshop scheduling (1)Energy efficient (1)Flowshop (1)Iterated Greedy (1)Multi-objective optimization (1)NSGA-II (1)Scheduling (1)Total energy consumption (1)... View MoreDate Issued2020 - 2021 (11)2010 - 2019 (92)Has File(s)No (101)Yes (2)

DSpace software copyright © 2002-2016  DuraSpace
Contact Us | Send Feedback
Theme by 
Atmire NV