We stand with Ukraine

We stand with Ukraine

Daniel Oron

Orcid: 0000-0002-2571-6676

According to our database¹, Daniel Oron authored at least 37 papers between 2004 and 2024.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

Scheduling coupled tasks on parallel identical machines.

[BibT_eX]

[DOI]

Mostafa Khatami

,

,

Amir Salehipour

Optim. Lett., May, 2024

Two-agent single-machine scheduling with a rate-modifying activity.

[BibT_eX]

[DOI]

Johnson Phosavanh

,

Eur. J. Oper. Res., February, 2024

2023

A note on batch scheduling on a two-machine flowshop with machine-dependent processing times.

[BibT_eX]

[DOI]

,

4OR, September, 2023

2022

On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates.

[BibT_eX]

[DOI]

,

,

J. Sched., 2022

Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work.

[BibT_eX]

[DOI]

,

,

Eur. J. Oper. Res., 2022

2021

Minimizing total late work on a single machine with generalized due-dates.

[BibT_eX]

[DOI]

,

,

Eur. J. Oper. Res., 2021

Coupled task scheduling with convex resource consumption functions.

[BibT_eX]

[DOI]

,

,

Amir Salehipour

Discret. Appl. Math., 2021

A note on scheduling a rate modifying activity to minimize total late work.

[BibT_eX]

[DOI]

,

Comput. Ind. Eng., 2021

2020

Scheduling problems with a weight-modifying-activity.

[BibT_eX]

[DOI]

,

Ann. Oper. Res., 2020

2019

Batching and resource allocation decisions on an m-machine proportionate flowshop.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2019

2017

Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times.

[BibT_eX]

[DOI]

,

,

Eur. J. Oper. Res., 2017

2016

Proportionate flow-shop scheduling with rejection.

[BibT_eX]

[DOI]

,

J. Oper. Res. Soc., 2016

2015

Multipurpose machine scheduling with rejection and identical job processing times.

[BibT_eX]

[DOI]

,

,

J. Sched., 2015

No-wait scheduling of position dependent jobs and adjustable processing intervals.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2015

Minimizing total completion time on a single machine with step improving jobs Open.

[BibT_eX]

[DOI]

,

J. Oper. Res. Soc., 2015

Single machine scheduling with two competing agents and equal job processing times.

[BibT_eX]

[DOI]

,

,

Eur. J. Oper. Res., 2015

2014

Scheduling controllable processing time jobs in a deteriorating environment.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2014

2013

Coordinating multi-location production and customer delivery.

[BibT_eX]

[DOI]

,

Optim. Lett., 2013

Multi-location production and delivery with job selection.

[BibT_eX]

[DOI]

,

Comput. Oper. Res., 2013

2012

The equal allocation policy in open shop batch scheduling.

[BibT_eX]

[DOI]

,

,

J. Oper. Res. Soc., 2012

Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times.

[BibT_eX]

[DOI]

,

Comput. Oper. Res., 2012

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].

[BibT_eX]

[DOI]

Mehmet Duran Toksari

,

,

Math. Comput. Model., 2011

Scheduling a batching machine with convex resource consumption functions.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

2010

Some scheduling problems with past sequence dependent setup times under the effects of nonlinear deterioration and time-dependent learning.

[BibT_eX]

[DOI]

Mehmet Duran Toksari

,

,

RAIRO Oper. Res., 2010

Optimal due date assignment and resource allocation in a group technology scheduling environment.

[BibT_eX]

[DOI]

,

Yisrael Itskovich

,

Liron Yedidsion

,

Comput. Oper. Res., 2010

2009

Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning.

[BibT_eX]

[DOI]

Mehmet Duran Toksari

,

,

Math. Comput. Model., 2009

The bipartite margin shop and maximum red matchings free of blue-red alternating cycles.

[BibT_eX]

[DOI]

,

,

Vadim G. Timkovsky

Discret. Optim., 2009

Batch Scheduling on Two-Machine Flowshop with Machine-Dependent Setup Times.

[BibT_eX]

[DOI]

,

,

Adv. Oper. Res., 2009

2008

Open-shop batch scheduling with identical jobs.

[BibT_eX]

[DOI]

,

Eur. J. Oper. Res., 2008

A single machine batch scheduling problem with bounded batch size.

[BibT_eX]

[DOI]

,

Eur. J. Oper. Res., 2008

Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2008

2007

Minmax scheduling with job-classes and earliness-tardiness costs.

[BibT_eX]

[DOI]

,

Eur. J. Oper. Res., 2007

2006

Due-date assignment and maintenance activity scheduling problem.

[BibT_eX]

[DOI]

,

Math. Comput. Model., 2006

Single machine scheduling with batch-dependent setup times.

[BibT_eX]

[DOI]

,

Inf. Process. Lett., 2006

2005

Minimizing flow-time on a single machine with integer batch sizes.

[BibT_eX]

[DOI]

,

,

Oper. Res. Lett., 2005

A note on flow-shop and job-shop batch scheduling with identical processing-time jobs.

[BibT_eX]

[DOI]

,

Eur. J. Oper. Res., 2005

2004

A note on the SPT heuristic for solving scheduling problems with generalized due dates.

[BibT_eX]

[DOI]

,

Comput. Oper. Res., 2004

Loading...