default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Oron
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j39]Johnson Phosavanh
, Daniel Oron:
Minimizing the number of late jobs and total late work with step-learning. Eur. J. Oper. Res. 321(3): 734-749 (2025)- 2024
- [j38]Johnson Phosavanh, Daniel Oron:
Two-agent single-machine scheduling with a rate-modifying activity. Eur. J. Oper. Res. 312(3): 866-876 (2024) - [j37]Mostafa Khatami, Daniel Oron, Amir Salehipour:
Scheduling coupled tasks on parallel identical machines. Optim. Lett. 18(4): 991-1003 (2024) - 2023
- [j36]Gur Mosheiov, Daniel Oron:
A note on batch scheduling on a two-machine flowshop with machine-dependent processing times. 4OR 21(3): 457-469 (2023) - 2022
- [j35]Dvir Shabtay, Gur Mosheiov, Daniel Oron:
Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work. Eur. J. Oper. Res. 303(1): 66-77 (2022) - [j34]Gur Mosheiov, Daniel Oron, Dvir Shabtay:
On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates. J. Sched. 25(5): 577-587 (2022) - 2021
- [j33]Gur Mosheiov, Daniel Oron:
A note on scheduling a rate modifying activity to minimize total late work. Comput. Ind. Eng. 154: 107138 (2021) - [j32]Gur Mosheiov, Daniel Oron, Amir Salehipour:
Coupled task scheduling with convex resource consumption functions. Discret. Appl. Math. 293: 128-133 (2021) - [j31]Gur Mosheiov, Daniel Oron, Dvir Shabtay:
Minimizing total late work on a single machine with generalized due-dates. Eur. J. Oper. Res. 293(3): 837-846 (2021) - 2020
- [j30]Gur Mosheiov, Daniel Oron:
Scheduling problems with a weight-modifying-activity. Ann. Oper. Res. 295(2): 737-745 (2020)
2010 – 2019
- 2019
- [j29]Daniel Oron:
Batching and resource allocation decisions on an m-machine proportionate flowshop. J. Oper. Res. Soc. 70(9): 1571-1578 (2019) - 2017
- [j28]Daniel Oron, Dvir Shabtay, George Steiner:
Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times. Eur. J. Oper. Res. 256(2): 384-391 (2017) - 2016
- [j27]Daniel Oron:
Scheduling controllable processing time jobs in a deteriorating environment. J. Oper. Res. Soc. 67(3): 535 (2016) - [j26]Dvir Shabtay, Daniel Oron:
Proportionate flow-shop scheduling with rejection. J. Oper. Res. Soc. 67(5): 752-769 (2016) - 2015
- [j25]Daniel Oron, Dvir Shabtay, George Steiner:
Single machine scheduling with two competing agents and equal job processing times. Eur. J. Oper. Res. 244(1): 86-99 (2015) - [j24]Daniel Oron:
No-wait scheduling of position dependent jobs and adjustable processing intervals. J. Oper. Res. Soc. 66(5): 732-736 (2015) - [j23]Eun-Seok Kim, Daniel Oron:
Minimizing total completion time on a single machine with step improving jobs Open. J. Oper. Res. Soc. 66(9): 1481-1490 (2015) - [j22]Dvir Shabtay, Shlomo Karhi, Daniel Oron:
Multipurpose machine scheduling with rejection and identical job processing times. J. Sched. 18(1): 75-88 (2015) - 2014
- [j21]Daniel Oron:
Scheduling controllable processing time jobs in a deteriorating environment. J. Oper. Res. Soc. 65(1): 49-56 (2014) - 2013
- [j20]Eun-Seok Kim, Daniel Oron:
Multi-location production and delivery with job selection. Comput. Oper. Res. 40(5): 1461-1466 (2013) - [j19]Eun-Seok Kim, Daniel Oron:
Coordinating multi-location production and customer delivery. Optim. Lett. 7(1): 39-50 (2013) - 2012
- [j18]Gur Mosheiov, Daniel Oron:
Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times. Comput. Oper. Res. 39(7): 1601-1604 (2012) - [j17]Baruch Mor, Gur Mosheiov, Daniel Oron:
The equal allocation policy in open shop batch scheduling. J. Oper. Res. Soc. 63(5): 646-652 (2012) - 2011
- [j16]Daniel Oron:
Scheduling a batching machine with convex resource consumption functions. Inf. Process. Lett. 111(19): 962-967 (2011) - [j15]Mehmet Duran Toksari, Daniel Oron, Ertan Güner:
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. 54(1-2): 849-851 (2011) - 2010
- [j14]Dvir Shabtay, Yisrael Itskovich, Liron Yedidsion, Daniel Oron:
Optimal due date assignment and resource allocation in a group technology scheduling environment. Comput. Oper. Res. 37(12): 2218-2228 (2010) - [j13]Mehmet Duran Toksari, Daniel Oron, Ertan Güner:
Some scheduling problems with past sequence dependent setup times under the effects of nonlinear deterioration and time-dependent learning. RAIRO Oper. Res. 44(2): 107-118 (2010)
2000 – 2009
- 2009
- [j12]Lika Ben-Dati, Gur Mosheiov, Daniel Oron:
Batch Scheduling on Two-Machine Flowshop with Machine-Dependent Setup Times. Adv. Oper. Res. 2009: 153910:1-153910:10 (2009) - [j11]Daniel Oron, George Steiner, Vadim G. Timkovsky:
The bipartite margin shop and maximum red matchings free of blue-red alternating cycles. Discret. Optim. 6(3): 299-309 (2009) - [j10]Mehmet Duran Toksari, Daniel Oron, Ertan Güner:
Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning. Math. Comput. Model. 50(3-4): 401-406 (2009) - 2008
- [j9]Daniel Oron:
Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times. Comput. Oper. Res. 35(6): 2071-2078 (2008) - [j8]Gur Mosheiov, Daniel Oron:
A single machine batch scheduling problem with bounded batch size. Eur. J. Oper. Res. 187(3): 1069-1079 (2008) - [j7]Gur Mosheiov, Daniel Oron:
Open-shop batch scheduling with identical jobs. Eur. J. Oper. Res. 187(3): 1282-1292 (2008) - 2007
- [j6]Gur Mosheiov, Daniel Oron:
Minmax scheduling with job-classes and earliness-tardiness costs. Eur. J. Oper. Res. 177(1): 612-622 (2007) - 2006
- [j5]Gur Mosheiov, Daniel Oron:
Single machine scheduling with batch-dependent setup times. Inf. Process. Lett. 98(2): 73-78 (2006) - [j4]Gur Mosheiov, Daniel Oron:
Due-date assignment and maintenance activity scheduling problem. Math. Comput. Model. 44(11-12): 1053-1057 (2006) - 2005
- [j3]Gur Mosheiov, Daniel Oron:
A note on flow-shop and job-shop batch scheduling with identical processing-time jobs. Eur. J. Oper. Res. 161(1): 285-291 (2005) - [j2]Gur Mosheiov, Daniel Oron, Yaacov Ritov:
Minimizing flow-time on a single machine with integer batch sizes. Oper. Res. Lett. 33(5): 497-501 (2005) - 2004
- [j1]Gur Mosheiov, Daniel Oron:
A note on the SPT heuristic for solving scheduling problems with generalized due dates. Comput. Oper. Res. 31(5): 645-655 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
