Deniz Türsel Eliiyi

Orcid: 0000-0001-7693-3980

According to our database1, Deniz Türsel Eliiyi authored at least 22 papers between 2004 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
A Greedy Algorithm for Minimum Cut into Bounded Sets Problem.
Proceedings of the 17th International Conference on Network and Service Management, 2021

2020
Ensemble of metaheuristics for energy-efficient hybrid flowshops: Makespan versus total energy consumption.
Swarm Evol. Comput., 2020

A Multiscale Algorithm for Joint Forecasting-Scheduling to Solve the Massive Access Problem of IoT.
IEEE Internet Things J., 2020

An energy-efficient permutation flowshop scheduling problem.
Expert Syst. Appl., 2020

Constraint programming models for integrated container terminal operations.
Eur. J. Oper. Res., 2020

Island-based Crow Search Algorithm for solving optimal control problems.
Appl. Soft Comput., 2020

Multi-Channel Joint Forecasting-Scheduling for the Internet of Things.
IEEE Access, 2020

Parallel Identification of Central Nodes in Wireless Multi-hop Networks.
Proceedings of the 28th Signal Processing and Communications Applications Conference, 2020

A Distributed Depth First Search based Algorithm for Edge Connectivity Estimation.
Proceedings of the 16th International Conference on Network and Service Management, 2020

2019
Metaheuristic algorithms for the hybrid flowshop scheduling problem.
Comput. Oper. Res., 2019

2018
Energy-Efficient Single Machine Total Weighted Tardiness Problem with Sequence-Dependent Setup Times.
Proceedings of the Intelligent Computing Theories and Application, 2018

Green Permutation Flowshop Scheduling: A Trade- off- Between Energy Consumption and Total Flow Time.
Proceedings of the Intelligent Computing Methodologies - 14th International Conference, 2018

Iterated greedy algorithms for the hybrid flowshop scheduling with total flow time minimization.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

Constraint and Mathematical Programming Models for Integrated Port Container Terminal Operations.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018

2017
An alternative MILP model for makespan minimization on assembly lines.
Optim. Lett., 2017

2015
A Multi-compartment Vehicle Routing Problem for Livestock Feed Distribution.
Proceedings of the Operations Research Proceedings 2015, 2015

2014
The state of the art on buffer allocation problem: a comprehensive survey.
J. Intell. Manuf., 2014

2013
Two approaches for solving the buffer allocation problem in unreliable production lines.
Comput. Oper. Res., 2013

A Comparison of Three Search Algorithms for Solving the Buffer Allocation Problem in Reliable Production Lines.
Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013

2012
An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines.
Comput. Oper. Res., 2012

2008
A Lagrangean relaxation approach for the mixed-model flow line sequencing problem.
Comput. Oper. Res., 2008

2004
Operational fixed job scheduling problem ; Operasyonel sabit iş çizelgelemesi problemi.
PhD thesis, 2004


  Loading...