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)

Heuristics for no-wait flowshops with makespan subject to mean completion time. - Harun Aydilek; Ali Allahverdi (Appl. Math. Comput., 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 two stage assembly flowshop scheduling problem to minimize total tardiness. - Ali Allahverdi; Harun Aydilek (J. Intell. Manuf., 2015)

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)

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)