Folgen
Fawaz S. Al-Anzi
Fawaz S. Al-Anzi
Professor of Computer Engineering, Kuwait University
Bestätigte E-Mail-Adresse bei ku.edu.kw
Titel
Zitiert von
Zitiert von
Jahr
A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
A Allahverdi, FS Al-Anzi
Computers & Operations Research 33 (4), 1056-1080, 2006
2112006
A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
FS Al-Anzi, A Allahverdi
European Journal of Operational Research 182 (1), 80-94, 2007
1542007
Toward an enhanced Arabic text classification using cosine similarity and Latent Semantic Indexing
FS Al-Anzi, D AbuZeina
Journal of King Saud University-Computer and Information Sciences 29 (2 …, 2017
1492017
A new algorithm to generate Arabic root-pattern forms
SS Al-Fedaghi, FS Al-Anzi
proceedings of the 11th national Computer Conference and Exhibition, 391-400, 1989
1311989
The two-stage assembly scheduling problem to minimize total completion time with setup times
A Allahverdi, FS Al-Anzi
Computers & Operations Research 36 (10), 2740-2747, 2009
1062009
Modified frequency-based term weighting schemes for text classification
T Sabbah, A Selamat, MH Selamat, FS Al-Anzi, EH Viedma, O Krejcar, ...
Applied Soft Computing 58, 193-206, 2017
1042017
The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time
A Allahverdi, FS Al-Anzi
The International Journal of Advanced Manufacturing Technology 37 (1), 166-177, 2008
952008
Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times
A Allahverdi, FS Al-Anzi
International Journal of Production Research 44 (22), 4713-4735, 2006
872006
Computer assembly scheduling problem
FS Al-Anzi, A Allahverdi
2006 International Conference on Service Systems and Service Management 2 …, 2006
772006
Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan
FS Al-Anzi, A Allahverdi
Computers & Operations Research 36 (9), 2682-2689, 2009
612009
Towards an efficient e-learning system based on cloud computing
E Aljenaa, FS Al-Anzi, M Alshayeji
Proceedings of the Second Kuwait Conference on e-Services and e-Systems, 1-7, 2011
562011
Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
A Allahverdi, FS Al-Anzi
Computers & Operations Research 29 (8), 971-994, 2002
482002
A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times
A Allahverdi, FS Al-Anzi
European Journal of Operational Research 169 (3), 767-780, 2006
462006
Using mixed graph coloring to minimize total completion time in job shop scheduling
FS Al-Anzi, YN Sotskov, A Allahverdi, GV Andreev
Applied mathematics and computation 182 (2), 1137-1148, 2006
452006
On the accuracy of ARIMA based prediction of COVID-19 spread
H Alabdulrazzaq, MN Alenezi, Y Rawajfih, BA Alghannam, AA Al-Hassan, ...
Results in Physics 27, 104509, 2021
422021
Employing fisher discriminant analysis for Arabic text classification
D AbuZeina, FS Al-Anzi
Computers & Electrical Engineering 66, 474-486, 2018
402018
An artificial immune system heuristic for two-stage multi-machine assembly scheduling problem to minimize total completion time
FS Al-Anzi, A Allahverdi
Journal of Manufacturing Systems 32 (4), 825-830, 2013
392013
Weighted multi-skill resources project scheduling
FS Al-Anzi, K Al-Zame, A Allahverdi
Journal of Software Engineering and Applications 3 (12), 1125, 2010
382010
Beyond vector space model for hierarchical Arabic text classification: A Markov chain approach
FS Al-Anzi, D AbuZeina
Information Processing & Management 54 (1), 105-115, 2018
352018
Scheduling multi-stage parallel-processor services to minimize average response time
A Allahverdi, FS Al-Anzi
Journal of the Operational Research Society 57 (1), 101-110, 2006
352006
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20