Daniel Oron

According to our database1, Daniel Oron authored at least 32 papers between 2004 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Minimizing total late work on a single machine with generalized due-dates.
Eur. J. Oper. Res., 2021

Coupled task scheduling with convex resource consumption functions.
Discret. Appl. Math., 2021

A note on scheduling a rate modifying activity to minimize total late work.
Comput. Ind. Eng., 2021

2020
Scheduling problems with a weight-modifying-activity.
Ann. Oper. Res., 2020

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

2017
Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times.
Eur. J. Oper. Res., 2017

2016
Proportionate flow-shop scheduling with rejection.
J. Oper. Res. Soc., 2016

Scheduling controllable processing time jobs in a deteriorating environment.
J. Oper. Res. Soc., 2016

2015
Multipurpose machine scheduling with rejection and identical job processing times.
J. Sched., 2015

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

Minimizing total completion time on a single machine with step improving jobs Open.
J. Oper. Res. Soc., 2015

Single machine scheduling with two competing agents and equal job processing times.
Eur. J. Oper. Res., 2015

2013
Coordinating multi-location production and customer delivery.
Optim. Lett., 2013

Multi-location production and delivery with job selection.
Comput. Oper. Res., 2013

2012
The equal allocation policy in open shop batch scheduling.
J. Oper. Res. Soc., 2012

Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times.
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].
Math. Comput. Model., 2011

Scheduling a batching machine with convex resource consumption functions.
Inf. Process. Lett., 2011

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

Optimal due date assignment and resource allocation in a group technology scheduling environment.
Comput. Oper. Res., 2010

2009
Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning.
Math. Comput. Model., 2009

The bipartite margin shop and maximum red matchings free of blue-red alternating cycles.
Discret. Optim., 2009

Batch Scheduling on Two-Machine Flowshop with Machine-Dependent Setup Times.
Adv. Oper. Res., 2009

2008
Open-shop batch scheduling with identical jobs.
Eur. J. Oper. Res., 2008

A single machine batch scheduling problem with bounded batch size.
Eur. J. Oper. Res., 2008

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

2007
Minmax scheduling with job-classes and earliness-tardiness costs.
Eur. J. Oper. Res., 2007

2006
Due-date assignment and maintenance activity scheduling problem.
Math. Comput. Model., 2006

Single machine scheduling with batch-dependent setup times.
Inf. Process. Lett., 2006

2005
Minimizing flow-time on a single machine with integer batch sizes.
Oper. Res. Lett., 2005

A note on flow-shop and job-shop batch scheduling with identical processing-time jobs.
Eur. J. Oper. Res., 2005

2004
A note on the SPT heuristic for solving scheduling problems with generalized due dates.
Comput. Oper. Res., 2004


  Loading...