Harun Aydilek
Harun Aydilek
Associate Professor of Applied Math at Gulf University for Science and Technology
Adresse e-mail validée de gust.edu.kw - Page d'accueil
Titre
Citée par
Citée par
Année
The two stage assembly flowshop scheduling problem to minimize total tardiness
A Allahverdi, H Aydilek
Journal of Intelligent Manufacturing 26 (2), 225-237, 2015
592015
No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
A Allahverdi, H Aydilek, A Aydilek
European Journal of Operational Research 269 (2), 590-601, 2018
362018
Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times
A Allahverdi, H Aydilek
International Journal of Production Research 48 (21), 6367-6385, 2010
342010
Total completion time with makespan constraint in no-wait flowshops with setup times
A Allahverdi, H Aydilek
European Journal of Operational Research 238 (3), 724-734, 2014
322014
Production in a two-machine flowshop scheduling environment with uncertain processing and setup times to minimize makespan
A Aydilek, H Aydilek, A Allahverdi
International Journal of Production Research 53 (9), 2803-2819, 2015
312015
Single machine scheduling problem with interval processing times to minimize mean weighted completion time
A Allahverdi, H Aydilek, A Aydilek
Computers & Operations Research 51, 200-207, 2014
292014
Algorithms for no-wait flowshops with total completion time subject to makespan
A Allahverdi, H Aydilek
The International Journal of Advanced Manufacturing Technology 68 (9-12 …, 2013
252013
Two-stage assembly scheduling problem for minimizing total tardiness with setup times
A Allahverdi, H Aydilek, A Aydilek
Applied Mathematical Modelling 40 (17-18), 7796-7815, 2016
232016
Increasing the profitability and competitiveness in a production environment with random and bounded setup times
A Aydilek, H Aydilek, A Allahverdi
International Journal of Production Research 51 (1), 106-117, 2013
232013
Heuristics for no-wait flowshops with makespan subject to mean completion time
H Aydilek, A Allahverdi
Applied Mathematics and Computation 219 (1), 351-359, 2012
222012
Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time
H Aydilek, A Allahverdi
Computers & mathematics with applications 59 (2), 684-693, 2010
212010
Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times
A Aydilek, H Aydilek, A Allahverdi
Applied mathematical modelling 45, 982-996, 2017
182017
A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times
H Aydilek, A Allahverdi
Applied Mathematical Modelling 37 (12-13), 7164-7173, 2013
162013
No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
A Allahverdi, H Aydilek, A Aydilek
Applied Mathematics and Computation 365, 124688, 2020
152020
Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times
A Allahverdi, H Aydilek
Computers & Mathematics with Applications 60 (5), 1374-1384, 2010
152010
Minimising maximum tardiness in assembly flowshops with setup times
A Aydilek, H Aydilek, A Allahverdi
International Journal of Production Research 55 (24), 7541-7565, 2017
112017
Minimizing the number of tardy jobs on a two-stage assembly flowshop
A Allahverdi, A Aydilek, H Aydilek
Journal of Industrial and Production Engineering 33 (6), 391-403, 2016
102016
New heuristics for no-wait flowshops with performance measures of makespan and mean completion time
H Aydilek, A Allahverdi
International Journal of Operations Research 10, 29-37, 2013
42013
A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure
M Allahverdi, H Aydilek, A Aydilek, A Allahverdi
Journal of Industrial & Management Optimization 17 (4), 1973, 2021
22021
An optimization model of retiree decisions under recursive utility with housing
A Aydilek, H Aydilek
Journal of Economics and Finance 44 (2), 258-277, 2020
22020
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20