Minimizing total completion time with linear deterioration: A new lower bound. - Matan Atsmony; Gur Mosheiov (Comput. Ind. Eng., 2022)

A Greedy heuristic for solving scheduling problems with bounded rejection cost. - Matan Atsmony; Gur Mosheiov (Comput. Oper. Res., 2022)

Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection. - Matan Atsmony; Gur Mosheiov (J. Sched., 2023)

Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity. - Matan Atsmony; Baruch Mor; Gur Mosheiov (Comput. Oper. Res., 2023)

Common due-date assignment problems with fixed-plus-linear earliness and tardiness costs. - Matan Atsmony; Gur Mosheiov (Comput. Ind. Eng., 2024)

Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection. - Matan Atsmony; Gur Mosheiov (Optim. Lett., 2024)

Single machine scheduling with step-learning. - Matan Atsmony; Baruch Mor; Gur Mosheiov (J. Sched., 2024)