Ali Allahverdi, Fawaz S. Al-Anzi Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications. [Citation Graph (0, 0)][DBLP] Computers & OR, 2002, v:29, n:8, pp:971-994 [Journal]
Ali Allahverdi, Fawaz S. Al-Anzi A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application. [Citation Graph (0, 0)][DBLP] Computers & OR, 2006, v:33, n:, pp:1056-1080 [Journal]
Salah Al-Sharhan, Fawaz S. Al-Anzi A Hybrid Evolutionary Algorithm For Multiple-Destinations Routing Problem. [Citation Graph (0, 0)][DBLP] International Journal of Computational Intelligence and Applications, 2004, v:4, n:4, pp:337-354 [Journal]
Fawaz S. Al-Anzi Producing Algorithmically Standard Romanization of Arabic Names Using Hints from Non-Standards. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Proc. Oriental Lang., 2004, v:17, n:3, pp:165-180 [Journal]
Fawaz S. Al-Anzi, Ali Allahverdi A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:182, n:1, pp:80-94 [Journal]
Ali Allahverdi, Fawaz S. Al-Anzi A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2006, v:169, n:3, pp:767-780 [Journal]
Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan. [Citation Graph (, )][DBLP]
The two-stage assembly scheduling problem to minimize total completion time with setup times. [Citation Graph (, )][DBLP]
Search in 0.059secs, Finished in 0.060secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP