Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness. - Ali Allahverdi (Comput. Oper. Res., 1996)

Scheduling in stochastic flowshops with independent setup, processing and removal times. - Ali Allahverdi (Comput. Oper. Res., 1997)

Total flowtime in no-wait flowshops with separated setup times. - Tariq A. Aldowaisan; Ali Allahverdi (Comput. Oper. Res., 1998)

Job lateness in flowshops with setup and removal times separated. - Ali Allahverdi; Tariq A. Aldowaisan (J. Oper. Res. Soc., 1998)

Stochastically minimizing total flowtime in flowshops with no waiting space. - Ali Allahverdi (Eur. J. Oper. Res., 1999)

Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times. - Ali Allahverdi (Comput. Oper. Res., 2000)

Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times. - Ali Allahverdi; Tariq A. Aldowaisan (J. Oper. Res. Soc., 2001)

Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications. - Ali Allahverdi; Fawaz S. Al-Anzi (Comput. Oper. Res., 2002)

Optimizing modular product design for reconfigurable manufacturing. - Ahmet S. Yigit; A. Galip Ulsoy; Ali Allahverdi (J. Intell. Manuf., 2002)

No-wait flowshops with bicriteria of makespan and total completion time. - Ali Allahverdi; Tariq A. Aldowaisan (J. Oper. Res. Soc., 2002)

Scheduling Requests on Multi-Stage Multi-Server to Increase Quality of Service. - Ali Allahverdi; Fawaz S. Al-Anzi (Net-Con, 2003)

New heuristics for no-wait flowshops to minimize makespan. - Tariq A. Aldowaisan; Ali Allahverdi (Comput. Oper. Res., 2003)

The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime. - Ali Allahverdi (Eur. J. Oper. Res., 2003)

A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness. - Ali Allahverdi (Comput. Oper. Res., 2004)

No-wait flowshops with bicriteria of makespan and maximum lateness. - Ali Allahverdi; Tariq A. Aldowaisan (Eur. J. Oper. Res., 2004)

Flowshop scheduling problem to minimize total completion time with random and bounded processing times. - Yuri N. Sotskov; Ali Allahverdi; Tsung-Chyan Lai (J. Oper. Res. Soc., 2004)

Using a Hybrid Evolutionary Algorithm to Minimize Variance in Response Time for Multimedia Object Requests. - Fawaz S. Al-Anzi; Ali Allahverdi (J. Math. Model. Algorithms, 2005)

Using mixed graph coloring to minimize total completion time in job shop scheduling. - Fawaz S. Al-Anzi; Yuri N. Sotskov; Ali Allahverdi; George V. Andreev (Appl. Math. Comput., 2006)

A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application. - Ali Allahverdi; Fawaz S. Al-Anzi (Comput. Oper. Res., 2006)

A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times. - Ali Allahverdi; Fawaz S. Al-Anzi (Eur. J. Oper. Res., 2006)

Scheduling multi-stage parallel-processor services to minimize average response time. - Ali Allahverdi; Fawaz S. Al-Anzi (J. Oper. Res. Soc., 2006)

Some effective heuristics for no-wait flowshops with setup times to minimize total completion time. - Rubén Ruiz; Ali Allahverdi (Ann. Oper. Res., 2007)

A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times. - Fawaz S. Al-Anzi; Ali Allahverdi (Eur. J. Oper. Res., 2007)

Batching deteriorating items with applications in computer communication and reverse logistics. - Fawaz S. Al-Anzi; Ali Allahverdi; Mikhail Y. Kovalyov (Eur. J. Oper. Res., 2007)

A survey of scheduling problems with setup times or costs. - Ali Allahverdi; C. T. Ng 001; T. C. Edwin Cheng; Mikhail Y. Kovalyov (Eur. J. Oper. Res., 2008)

The significance of reducing setup times/setup costs. - Ali Allahverdi; H. M. Soroush (Eur. J. Oper. Res., 2008)

Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan. - Fawaz S. Al-Anzi; Ali Allahverdi (Comput. Oper. Res., 2009)

The two-stage assembly scheduling problem to minimize total completion time with setup times. - Ali Allahverdi; Fawaz S. Al-Anzi (Comput. Oper. Res., 2009)

Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness. - Rubén Ruiz; Ali Allahverdi (Comput. Oper. Res., 2009)

Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times. - Ali Allahverdi; Harun Aydilek (Comput. Math. Appl., 2010)

Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time. - Harun Aydilek; Ali Allahverdi (Comput. Math. Appl., 2010)

Weighted Multi-Skill Resources Project Scheduling. - Fawaz S. Al-Anzi; Khaled Al-Zame; Ali Allahverdi (J. Softw. Eng. Appl., 2010)

Heuristics for no-wait flowshops with makespan subject to mean completion time. - Harun Aydilek; Ali Allahverdi (Appl. Math. Comput., 2012)

Minimizing the total completion time in a two-machine flowshop with sequence-independent setup times. - Talel Ladhari; Mohamed Kais Msakni; Ali Allahverdi (J. Oper. Res. Soc., 2012)

Single machine scheduling problem with interval processing times to minimize mean weighted completion time. - Ali Allahverdi; Harun Aydilek; Asiye Aydilek (Comput. Oper. Res., 2014)

Total completion time with makespan constraint in no-wait flowshops with setup times. - Ali Allahverdi; Harun Aydilek (Eur. J. Oper. Res., 2014)

The third comprehensive survey on scheduling problems with setup times/costs. - Ali Allahverdi (Eur. J. Oper. Res., 2015)

The two stage assembly flowshop scheduling problem to minimize total tardiness. - Ali Allahverdi; Harun Aydilek (J. Intell. Manuf., 2015)

A survey of scheduling problems with no-wait in process. - Ali Allahverdi (Eur. J. Oper. Res., 2016)

Minimising maximum tardiness in assembly flowshops with setup times. - Asiye Aydilek; Harun Aydilek; Ali Allahverdi (Int. J. Prod. Res., 2017)

No-wait flowshop scheduling problem with two criteria; total tardiness and makespan. - Ali Allahverdi; Harun Aydilek; Asiye Aydilek (Eur. J. Oper. Res., 2018)

Scheduling in manufacturing systems: new trends and perspectives. - Ali Allahverdi; Erwin Pesch; Michael L. Pinedo; Frank Werner 001 (Int. J. Prod. Res., 2018)

No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan. - Ali Allahverdi; Harun Aydilek; Asiye Aydilek (Appl. Math. Comput., 2020)

Algorithms for four-machine flowshop scheduling problem with uncertain processing times to minimize makespan. - Muberra Allahverdi; Ali Allahverdi (RAIRO Oper. Res., 2020)

Minimizing total completion time for flowshop scheduling problem with uncertain processing times. - Muberra Allahverdi; Ali Allahverdi (RAIRO Oper. Res., 2021)

Algorithms for three-machine flowshop scheduling problem to minimize makespan with uncertain processing times. - Ali Allahverdi; Muberra Allahverdi (RAIRO Oper. Res., 2023)