A flexible flowshop problem with total flow time minimization. - Meral Azizoglu; Ergin Çakmak; Suna Kondakci Köksalan (Eur. J. Oper. Res., 2001)

Single machine scheduling with maximum earliness and number tardy. - Meral Azizoglu; Suna Kondakci Köksalan; Murat Köksalan (Comput. Ind. Eng., 2003)

Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed. - Meral Azizoglu; Murat Köksalan; Suna Kondakci Köksalan (J. Oper. Res. Soc., 2003)

Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan. - Berkin Toktas; Meral Azizoglu; Suna Kondakci Köksalan (Eur. J. Oper. Res., 2004)