Segui
Muberra Allahverdi
Muberra Allahverdi
Kean University
Nessuna email verificata
Titolo
Citata da
Citata da
Anno
Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness
A Allahverdi, M Allahverdi
Computational and Applied Mathematics 37, 6774-6794, 2018
172018
Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times
M Allahverdi, A Allahverdi
Journal of Industrial and Management Optimization 16 (5), 2439-2457, 2020
112020
Algorithms for four-machine flowshop scheduling problem with uncertain processing times to minimize makespan
M Allahverdi, A Allahverdi
RAIRO-Operations Research 54 (2), 529-553, 2020
72020
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 and Management Optimization 17 (4), 1973-1991, 2021
62021
More effective heuristics for a two-machine no-wait flowshop to minimize maximum lateness
H Aydilek, A Aydilek, M Allahverdi, A Allahverdi
International Journal of Industrial Engineering Computations 13 (4), 543-556, 2022
32022
An improved algorithm to minimize the total completion time in a two-machine no-wait flow-shop with uncertain setup times
M Allahverdi
Journal of Project Management 7 (1), 1-12, 2022
32022
Minimizing total completion time for flowshop scheduling problem with uncertain processing times
M Allahverdi, A Allahverdi
RAIRO-Operations Research 55, S929-S946, 2021
22021
Acyclicity of Schur complexes and torsion freeness of Schur modules
M Allahverdi, A Tchernev
Journal of Algebra 535, 133-158, 2019
22019
Torsion Freeness of Symmetric Powers, Exterior Powers, and Schur Functors
M Allahverdi
State University of New York at Albany, 2017
22017
A Substantially Improved New Algorithm for Flowshop Scheduling Problem with Uncertain Processing Times
M ALLAHVERDİ
International Journal of Engineering Research and Development 14 (1), 155-163, 2022
12022
Minimizing Makespan For Flowshop Scheduling Problem with Random and Bounded Processing Times
M Allahverdi
International Journal of Business and Technology Management 3 (2), 49-52, 2021
12021
Four-machine flowshop scheduling problem with uncertain processing times to minimize mean completion time
M Allahverdi, A Allahverdi
International Journal of Business and Technology Management 3 (2), 44-48, 2021
12021
An Improved Algorithm for Minimizing Makespan on Flowshops with Uncertain Processing Times
A ALLAHVERDİ, M ALLAHVERDİ
International Journal of Engineering Research and Development 13 (2), 521-530, 2021
12021
Minimizing mean completion time for a two-machine no-wait flowshop scheduling problem
M Allahverdi, A Allahverdi
CONTEMPORARY ISSUES IN BUSINESS & ECONOMICS (ICCIBE), 270, 2018
12018
Minimizing makespan in flowshops with bounded processing times
M Allahverdi, A Allahverdi
Proc. of the VI. International GAP Engineering Conference, Sanliurfa, Turkey …, 2018
12018
A New Dominance Relation No-Wait Flowshop Scheduling Problems with Interval Setup Times
M Allahverdi
International Journal of Advanced Research in Engineering Innovation 4 (4 …, 2022
2022
Torsion Freeness of Schur Modules
M Allahverdi, A Tchernev
arXiv preprint arXiv:1808.00602, 2018
2018
Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times
M Allahverdi
Hacettepe Journal of Mathematics and Statistics, 1-12, 0
Algorithms and Effective Dominance Relations for a No-Wait Flowshop Scheduling with Random Setup Times
H Aydilek, M Allahverdi, A Aydilek, A Allahverdi
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–19