A note on the SPT heuristic for solving scheduling problems with generalized due dates. - Gur Mosheiov; Daniel Oron (Comput. Oper. Res., 2004)

A note on flow-shop and job-shop batch scheduling with identical processing-time jobs. - Gur Mosheiov; Daniel Oron (Eur. J. Oper. Res., 2005)

Minimizing flow-time on a single machine with integer batch sizes. - Gur Mosheiov; Daniel Oron; Yaacov Ritov (Oper. Res. Lett., 2005)

Single machine scheduling with batch-dependent setup times. - Gur Mosheiov; Daniel Oron (Inf. Process. Lett., 2006)

Due-date assignment and maintenance activity scheduling problem. - Gur Mosheiov; Daniel Oron (Math. Comput. Model., 2006)

Minmax scheduling with job-classes and earliness-tardiness costs. - Gur Mosheiov; Daniel Oron (Eur. J. Oper. Res., 2007)

Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times. - Daniel Oron (Comput. Oper. Res., 2008)

A single machine batch scheduling problem with bounded batch size. - Gur Mosheiov; Daniel Oron (Eur. J. Oper. Res., 2008)

Open-shop batch scheduling with identical jobs. - Gur Mosheiov; Daniel Oron (Eur. J. Oper. Res., 2008)

Batch Scheduling on Two-Machine Flowshop with Machine-Dependent Setup Times. - Lika Ben-Dati; Gur Mosheiov; Daniel Oron (Adv. Oper. Res., 2009)

The bipartite margin shop and maximum red matchings free of blue-red alternating cycles. - Daniel Oron; George Steiner; Vadim G. Timkovsky (Discret. Optim., 2009)

Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning. - Mehmet Duran Toksari; Daniel Oron; Ertan Güner (Math. Comput. Model., 2009)

Optimal due date assignment and resource allocation in a group technology scheduling environment. - Dvir Shabtay; Yisrael Itskovich; Liron Yedidsion; Daniel Oron (Comput. Oper. Res., 2010)

Some scheduling problems with past sequence dependent setup times under the effects of nonlinear deterioration and time-dependent learning. - Mehmet Duran Toksari; Daniel Oron; Ertan Güner (RAIRO Oper. Res., 2010)

Scheduling a batching machine with convex resource consumption functions. - Daniel Oron (Inf. Process. Lett., 2011)

Joint reply to the erratum and the note on "Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning" [Math. Comput. Modelling 50 (2009) 401-406]. - Mehmet Duran Toksari; Daniel Oron; Ertan Güner (Math. Comput. Model., 2011)

Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times. - Gur Mosheiov; Daniel Oron (Comput. Oper. Res., 2012)

The equal allocation policy in open shop batch scheduling. - Baruch Mor; Gur Mosheiov; Daniel Oron (J. Oper. Res. Soc., 2012)

Multi-location production and delivery with job selection. - Eun-Seok Kim; Daniel Oron (Comput. Oper. Res., 2013)

Coordinating multi-location production and customer delivery. - Eun-Seok Kim; Daniel Oron (Optim. Lett., 2013)

Scheduling controllable processing time jobs in a deteriorating environment. - Daniel Oron (J. Oper. Res. Soc., 2014)

Single machine scheduling with two competing agents and equal job processing times. - Daniel Oron; Dvir Shabtay; George Steiner (Eur. J. Oper. Res., 2015)

Minimizing total completion time on a single machine with step improving jobs Open. - Eun-Seok Kim; Daniel Oron (J. Oper. Res. Soc., 2015)

No-wait scheduling of position dependent jobs and adjustable processing intervals. - Daniel Oron (J. Oper. Res. Soc., 2015)

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

Proportionate flow-shop scheduling with rejection. - Dvir Shabtay; Daniel Oron (J. Oper. Res. Soc., 2016)

Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times. - Daniel Oron; Dvir Shabtay; George Steiner (Eur. J. Oper. Res., 2017)

Batching and resource allocation decisions on an m-machine proportionate flowshop. - Daniel Oron (J. Oper. Res. Soc., 2019)

Scheduling problems with a weight-modifying-activity. - Gur Mosheiov; Daniel Oron (Ann. Oper. Res., 2020)

A note on scheduling a rate modifying activity to minimize total late work. - Gur Mosheiov; Daniel Oron (Comput. Ind. Eng., 2021)

Coupled task scheduling with convex resource consumption functions. - Gur Mosheiov; Daniel Oron; Amir Salehipour (Discret. Appl. Math., 2021)

Minimizing total late work on a single machine with generalized due-dates. - Gur Mosheiov; Daniel Oron; Dvir Shabtay (Eur. J. Oper. Res., 2021)

Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work. - Dvir Shabtay; Gur Mosheiov; Daniel Oron (Eur. J. Oper. Res., 2022)

On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates. - Gur Mosheiov; Daniel Oron; Dvir Shabtay (J. Sched., 2022)

A note on batch scheduling on a two-machine flowshop with machine-dependent processing times. - Gur Mosheiov; Daniel Oron (4OR, 2023)

Two-agent single-machine scheduling with a rate-modifying activity. - Johnson Phosavanh; Daniel Oron (Eur. J. Oper. Res., 2024)

Scheduling coupled tasks on parallel identical machines. - Mostafa Khatami; Daniel Oron; Amir Salehipour (Optim. Lett., 2024)

Minimizing the number of late jobs and total late work with step-learning. - Johnson Phosavanh; Daniel Oron (Eur. J. Oper. Res., 2025)

Single-machine scheduling with fixed energy recharging times to minimize the number of late jobs and the number of just-in-time jobs: A parameterized complexity analysis. - Renjie Yu; Daniel Oron (Eur. J. Oper. Res., 2025)