default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAli Allahverdi
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j45]Ali Allahverdi, Muberra Allahverdi:
Algorithms for three-machine flowshop scheduling problem to minimize makespan with uncertain processing times. RAIRO Oper. Res. 57(4): 1733-1743 (2023)- 2021
- [j44]Muberra Allahverdi, Ali Allahverdi:
Minimizing total completion time for flowshop scheduling problem with uncertain processing times. RAIRO Oper. Res. 55(Supplement): S929-S946 (2021) - 2020
- [j43]Ali Allahverdi, Harun Aydilek
, Asiye Aydilek:
No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan. Appl. Math. Comput. 365 (2020) - [j42]Muberra Allahverdi, Ali Allahverdi:
Algorithms for four-machine flowshop scheduling problem with uncertain processing times to minimize makespan. RAIRO Oper. Res. 54(2): 529-553 (2020)
2010 – 2019
- 2018
- [j41]Ali Allahverdi, Harun Aydilek, Asiye Aydilek:
No-wait flowshop scheduling problem with two criteria; total tardiness and makespan. Eur. J. Oper. Res. 269(2): 590-601 (2018) - [j40]Ali Allahverdi, Erwin Pesch, Michael L. Pinedo, Frank Werner:
Scheduling in manufacturing systems: new trends and perspectives. Int. J. Prod. Res. 56(19): 6333-6335 (2018) - 2017
- [j39]Asiye Aydilek, Harun Aydilek, Ali Allahverdi:
Minimising maximum tardiness in assembly flowshops with setup times. Int. J. Prod. Res. 55(24): 7541-7565 (2017) - 2016
- [j38]Ali Allahverdi:
A survey of scheduling problems with no-wait in process. Eur. J. Oper. Res. 255(3): 665-686 (2016) - 2015
- [j37]Ali Allahverdi:
The third comprehensive survey on scheduling problems with setup times/costs. Eur. J. Oper. Res. 246(2): 345-378 (2015) - [j36]Ali Allahverdi, Harun Aydilek:
The two stage assembly flowshop scheduling problem to minimize total tardiness. J. Intell. Manuf. 26(2): 225-237 (2015) - 2014
- [j35]Ali Allahverdi, Harun Aydilek, Asiye Aydilek:
Single machine scheduling problem with interval processing times to minimize mean weighted completion time. Comput. Oper. Res. 51: 200-207 (2014) - [j34]Ali Allahverdi, Harun Aydilek:
Total completion time with makespan constraint in no-wait flowshops with setup times. Eur. J. Oper. Res. 238(3): 724-734 (2014) - 2012
- [j33]Harun Aydilek, Ali Allahverdi:
Heuristics for no-wait flowshops with makespan subject to mean completion time. Appl. Math. Comput. 219(1): 351-359 (2012) - [j32]Talel Ladhari, Mohamed Kais Msakni, Ali Allahverdi:
Minimizing the total completion time in a two-machine flowshop with sequence-independent setup times. J. Oper. Res. Soc. 63(4): 445-459 (2012) - 2010
- [j31]Harun Aydilek, Ali Allahverdi:
Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time. Comput. Math. Appl. 59(2): 684-693 (2010) - [j30]Ali Allahverdi, Harun Aydilek:
Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times. Comput. Math. Appl. 60(5): 1374-1384 (2010) - [j29]Fawaz S. Al-Anzi, Khaled Al-Zame, Ali Allahverdi:
Weighted Multi-Skill Resources Project Scheduling. J. Softw. Eng. Appl. 3(12): 1125-1130 (2010)
2000 – 2009
- 2009
- [j28]Rubén Ruiz, Ali Allahverdi:
Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness. Comput. Oper. Res. 36(4): 1268-1283 (2009) - [j27]Fawaz S. Al-Anzi, Ali Allahverdi:
Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan. Comput. Oper. Res. 36(9): 2682-2689 (2009) - [j26]Ali Allahverdi, Fawaz S. Al-Anzi:
The two-stage assembly scheduling problem to minimize total completion time with setup times. Comput. Oper. Res. 36(10): 2740-2747 (2009) - 2008
- [j25]Ali Allahverdi, H. M. Soroush:
The significance of reducing setup times/setup costs. Eur. J. Oper. Res. 187(3): 978-984 (2008) - [j24]Ali Allahverdi, C. T. Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov:
A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res. 187(3): 985-1032 (2008) - 2007
- [j23]Rubén Ruiz, Ali Allahverdi:
Some effective heuristics for no-wait flowshops with setup times to minimize total completion time. Ann. Oper. Res. 156(1): 143-171 (2007) - [j22]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. Eur. J. Oper. Res. 182(1): 80-94 (2007) - [j21]Fawaz S. Al-Anzi, Ali Allahverdi, Mikhail Y. Kovalyov:
Batching deteriorating items with applications in computer communication and reverse logistics. Eur. J. Oper. Res. 182(3): 1002-1011 (2007) - 2006
- [j20]Fawaz S. Al-Anzi, Yuri N. Sotskov, Ali Allahverdi, George V. Andreev:
Using mixed graph coloring to minimize total completion time in job shop scheduling. Appl. Math. Comput. 182(2): 1137-1148 (2006) - [j19]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. Comput. Oper. Res. 33: 1056-1080 (2006) - [j18]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. Eur. J. Oper. Res. 169(3): 767-780 (2006) - [j17]Ali Allahverdi, Fawaz S. Al-Anzi:
Scheduling multi-stage parallel-processor services to minimize average response time. J. Oper. Res. Soc. 57(1): 101-110 (2006) - 2005
- [j16]Fawaz S. Al-Anzi, Ali Allahverdi:
Using a Hybrid Evolutionary Algorithm to Minimize Variance in Response Time for Multimedia Object Requests. J. Math. Model. Algorithms 4(4): 435-453 (2005) - 2004
- [j15]Ali Allahverdi:
A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness. Comput. Oper. Res. 31(2): 157-180 (2004) - [j14]Ali Allahverdi, Tariq A. Aldowaisan:
No-wait flowshops with bicriteria of makespan and maximum lateness. Eur. J. Oper. Res. 152(1): 132-147 (2004) - [j13]Yuri N. Sotskov, Ali Allahverdi, Tsung-Chyan Lai:
Flowshop scheduling problem to minimize total completion time with random and bounded processing times. J. Oper. Res. Soc. 55(3): 277-286 (2004) - 2003
- [j12]Tariq A. Aldowaisan, Ali Allahverdi:
New heuristics for no-wait flowshops to minimize makespan. Comput. Oper. Res. 30(8): 1219-1231 (2003) - [j11]Ali Allahverdi:
The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime. Eur. J. Oper. Res. 147(2): 373-396 (2003) - [c1]Ali Allahverdi, Fawaz S. Al-Anzi:
Scheduling Requests on Multi-Stage Multi-Server to Increase Quality of Service. Net-Con 2003: 14-25 - 2002
- [j10]Ali Allahverdi, Fawaz S. Al-Anzi:
Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications. Comput. Oper. Res. 29(8): 971-994 (2002) - [j9]Ahmet S. Yigit, A. Galip Ulsoy, Ali Allahverdi:
Optimizing modular product design for reconfigurable manufacturing. J. Intell. Manuf. 13(4): 309-316 (2002) - [j8]Ali Allahverdi, Tariq A. Aldowaisan:
No-wait flowshops with bicriteria of makespan and total completion time. J. Oper. Res. Soc. 53(9): 1004-1015 (2002) - 2001
- [j7]Ali Allahverdi, Tariq A. Aldowaisan:
Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times. J. Oper. Res. Soc. 52(4): 449-462 (2001) - 2000
- [j6]Ali Allahverdi:
Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times. Comput. Oper. Res. 27(2): 111-127 (2000)
1990 – 1999
- 1999
- [j5]Ali Allahverdi:
Stochastically minimizing total flowtime in flowshops with no waiting space. Eur. J. Oper. Res. 113(1): 101-112 (1999) - 1998
- [j4]Tariq A. Aldowaisan, Ali Allahverdi:
Total flowtime in no-wait flowshops with separated setup times. Comput. Oper. Res. 25(9): 757-765 (1998) - [j3]Ali Allahverdi, Tariq A. Aldowaisan:
Job lateness in flowshops with setup and removal times separated. J. Oper. Res. Soc. 49(9): 1001-1006 (1998) - 1997
- [j2]Ali Allahverdi:
Scheduling in stochastic flowshops with independent setup, processing and removal times. Comput. Oper. Res. 24(10): 955-960 (1997) - 1996
- [j1]Ali Allahverdi:
Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness. Comput. Oper. Res. 23(10): 909-916 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
