Online scheduling of two job types on a set of multipurpose machines with unit processing times. - Dvir Shabtay; Shlomo Karhi (Comput. Oper. Res., 2012)

An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times. - Dvir Shabtay; Shlomo Karhi (Discret. Optim., 2012)

On the optimality of the TLS algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines. - Shlomo Karhi; Dvir Shabtay (J. Comb. Optim., 2013)

Multipurpose machine scheduling with rejection and identical job processing times. - Dvir Shabtay; Shlomo Karhi; Daniel Oron (J. Sched., 2015)

New Algorithms for Minimizing the Weighted Number of Tardy Jobs On a Single Machine. - Danny Hermelin; Shlomo Karhi; Mike Pinedo; Dvir Shabtay (CoRR, 2017)

Single machine scheduling to minimise resource consumption cost with a bound on scheduling plus due date assignment penalties. - Shlomo Karhi; Dvir Shabtay (Int. J. Prod. Res., 2018)

Semi-online scheduling of two job types on a set of multipurpose machines. - Shlomo Karhi (J. Oper. Res. Soc., 2018)

Online packing of arbitrary sized items into designated and multipurpose bins. - Noam Goldberg; Shlomo Karhi (Eur. J. Oper. Res., 2019)

New algorithms for minimizing the weighted number of tardy jobs on a single machine. - Danny Hermelin; Shlomo Karhi; Michael L. Pinedo; Dvir Shabtay (Ann. Oper. Res., 2021)