Ali Allahverdi

46 papers Journal 45Unranked 1
YearRankTypeTitle / Venue / Authors
2023 J jnl
Algorithms for three-machine flowshop scheduling problem to minimize makespan with uncertain processing times.
RAIRO Oper. Res.
Ali Allahverdi, Muberra Allahverdi
2021 J jnl
Minimizing total completion time for flowshop scheduling problem with uncertain processing times.
RAIRO Oper. Res.
Muberra Allahverdi, Ali Allahverdi
2020 J jnl
Algorithms for four-machine flowshop scheduling problem with uncertain processing times to minimize makespan.
RAIRO Oper. Res.
Muberra Allahverdi, Ali Allahverdi
2020 J jnl
No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan.
Appl. Math. Comput.
Ali Allahverdi, Harun Aydilek, Asiye Aydilek
2018 J jnl
No-wait flowshop scheduling problem with two criteria; total tardiness and makespan.
Eur. J. Oper. Res.
Ali Allahverdi, Harun Aydilek, Asiye Aydilek
2018 J jnl
Scheduling in manufacturing systems: new trends and perspectives.
Int. J. Prod. Res.
Ali Allahverdi, Erwin Pesch, Michael L. Pinedo, Frank Werner
2017 J jnl
Minimising maximum tardiness in assembly flowshops with setup times.
Int. J. Prod. Res.
Asiye Aydilek, Harun Aydilek, Ali Allahverdi
2016 J jnl
A survey of scheduling problems with no-wait in process.
Eur. J. Oper. Res.
Ali Allahverdi
2015 J jnl
The third comprehensive survey on scheduling problems with setup times/costs.
Eur. J. Oper. Res.
Ali Allahverdi
2015 J jnl
The two stage assembly flowshop scheduling problem to minimize total tardiness.
J. Intell. Manuf.
Ali Allahverdi, Harun Aydilek
2014 J jnl
Single machine scheduling problem with interval processing times to minimize mean weighted completion time.
Comput. Oper. Res.
Ali Allahverdi, Harun Aydilek, Asiye Aydilek
2014 J jnl
Total completion time with makespan constraint in no-wait flowshops with setup times.
Eur. J. Oper. Res.
Ali Allahverdi, Harun Aydilek
2012 J jnl
Heuristics for no-wait flowshops with makespan subject to mean completion time.
Appl. Math. Comput.
Harun Aydilek, Ali Allahverdi
2012 J jnl
Minimizing the total completion time in a two-machine flowshop with sequence-independent setup times.
J. Oper. Res. Soc.
Talel Ladhari, Mohamed Kais Msakni, Ali Allahverdi
2010 J jnl
Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times.
Comput. Math. Appl.
Ali Allahverdi, Harun Aydilek
2010 J jnl
Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time.
Comput. Math. Appl.
Harun Aydilek, Ali Allahverdi
2010 J jnl
Weighted Multi-Skill Resources Project Scheduling.
J. Softw. Eng. Appl.
Fawaz S. Al-Anzi, Khaled Al-Zame, Ali Allahverdi
2009 J jnl
Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan.
Comput. Oper. Res.
Fawaz S. Al-Anzi, Ali Allahverdi
2009 J jnl
Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness.
Comput. Oper. Res.
Rubén Ruiz, Ali Allahverdi
2009 J jnl
The two-stage assembly scheduling problem to minimize total completion time with setup times.
Comput. Oper. Res.
Ali Allahverdi, Fawaz S. Al-Anzi
2008 J jnl
A survey of scheduling problems with setup times or costs.
Eur. J. Oper. Res.
Ali Allahverdi, C. T. Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov
2008 J jnl
The significance of reducing setup times/setup costs.
Eur. J. Oper. Res.
Ali Allahverdi, H. M. Soroush
2007 J jnl
A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times.
Eur. J. Oper. Res.
Fawaz S. Al-Anzi, Ali Allahverdi
2007 J jnl
Batching deteriorating items with applications in computer communication and reverse logistics.
Eur. J. Oper. Res.
Fawaz S. Al-Anzi, Ali Allahverdi, Mikhail Y. Kovalyov
2007 J jnl
Some effective heuristics for no-wait flowshops with setup times to minimize total completion time.
Ann. Oper. Res.
Rubén Ruiz, Ali Allahverdi
2006 J jnl
A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application.
Comput. Oper. Res.
Ali Allahverdi, Fawaz S. Al-Anzi
2006 J jnl
A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times.
Eur. J. Oper. Res.
Ali Allahverdi, Fawaz S. Al-Anzi
2006 J jnl
Scheduling multi-stage parallel-processor services to minimize average response time.
J. Oper. Res. Soc.
Ali Allahverdi, Fawaz S. Al-Anzi
2006 J jnl
Using mixed graph coloring to minimize total completion time in job shop scheduling.
Appl. Math. Comput.
Fawaz S. Al-Anzi, Yuri N. Sotskov, Ali Allahverdi, George V. Andreev
2005 J jnl
Using a Hybrid Evolutionary Algorithm to Minimize Variance in Response Time for Multimedia Object Requests.
J. Math. Model. Algorithms
Fawaz S. Al-Anzi, Ali Allahverdi
2004 J jnl
A new heuristic for
Comput. Oper. Res.
Ali Allahverdi
2004 J jnl
Flowshop scheduling problem to minimize total completion time with random and bounded processing times.
J. Oper. Res. Soc.
Yuri N. Sotskov, Ali Allahverdi, Tsung-Chyan Lai
2004 J jnl
No-wait flowshops with bicriteria of makespan and maximum lateness.
Eur. J. Oper. Res.
Ali Allahverdi, Tariq A. Aldowaisan
2003 J jnl
New heuristics for no-wait flowshops to minimize makespan.
Comput. Oper. Res.
Tariq A. Aldowaisan, Ali Allahverdi
2003 — conf
Scheduling Requests on Multi-Stage Multi-Server to Increase Quality of Service.
Net-Con
Ali Allahverdi, Fawaz S. Al-Anzi
2003 J jnl
The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime.
Eur. J. Oper. Res.
Ali Allahverdi
2002 J jnl
No-wait flowshops with bicriteria of makespan and total completion time.
J. Oper. Res. Soc.
Ali Allahverdi, Tariq A. Aldowaisan
2002 J jnl
Optimizing modular product design for reconfigurable manufacturing.
J. Intell. Manuf.
Ahmet S. Yigit, A. Galip Ulsoy, Ali Allahverdi
2002 J jnl
Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications.
Comput. Oper. Res.
Ali Allahverdi, Fawaz S. Al-Anzi
2001 J jnl
Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times.
J. Oper. Res. Soc.
Ali Allahverdi, Tariq A. Aldowaisan
2000 J jnl
Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times.
Comput. Oper. Res.
Ali Allahverdi
1999 J jnl
Stochastically minimizing total flowtime in flowshops with no waiting space.
Eur. J. Oper. Res.
Ali Allahverdi
1998 J jnl
Job lateness in flowshops with setup and removal times separated.
J. Oper. Res. Soc.
Ali Allahverdi, Tariq A. Aldowaisan
1998 J jnl
Total flowtime in no-wait flowshops with separated setup times.
Comput. Oper. Res.
Tariq A. Aldowaisan, Ali Allahverdi
1997 J jnl
Scheduling in stochastic flowshops with independent setup, processing and removal times.
Comput. Oper. Res.
Ali Allahverdi
1996 J jnl
Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness.
Comput. Oper. Res.
Ali Allahverdi