default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLiron Yedidsion
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j21]Miri Gilenson, Dvir Shabtay
, Liron Yedidsion, Rohit Malshe:
Scheduling in multi-scenario environment with an agreeable condition on job processing times. Ann. Oper. Res. 307(1): 153-173 (2021)- [j20]Baruch Mor, Dvir Shabtay, Liron Yedidsion:
Heuristic algorithms for solving a set of NP-hard single-machine scheduling problems with resource-dependent processing times. Comput. Ind. Eng. 153: 107024 (2021) - [j19]Galit B. Yom-Tov, Liron Yedidsion, Yueming Xie:
An Invitation Control Policy for Proactive Service Systems: Balancing Efficiency, Value, and Service Level. Manuf. Serv. Oper. Manag. 23(5): 1077-1095 (2021) - 2020
- [j18]Danny Hermelin, George Manoussakis, Michael L. Pinedo, Dvir Shabtay, Liron Yedidsion:
Parameterized Multi-Scenario Single-Machine Scheduling Problems. Algorithmica 82(9): 2644-2667 (2020) - [j17]Michael Hassoun, Shraga Shoval, Eran Simchon, Liron Yedidsion:
The single line moving target traveling salesman problem with release times. Ann. Oper. Res. 289(2): 449-458 (2020) - [i2]Alexander Tuisov, Liron Yedidsion:
The Continuous Joint Replenishment Problem is Strongly NP-Hard. CoRR abs/2006.05310 (2020)
2010 – 2019
- 2019
- [j16]Miri Gilenson, Hussein Naseraldin, Liron Yedidsion:
An approximation scheme for the bi-scenario sum of completion times trade-off problem. J. Sched. 22(3): 289-304 (2019) - 2018
- [j15]Tamar Cohen-Hillel, Liron Yedidsion:
The Periodic Joint Replenishment Problem Is Strongly 𝒩𝒫-Hard. Math. Oper. Res. 43(4): 1269-1289 (2018) - 2017
- [j14]Liron Yedidsion, Dvir Shabtay:
The resource dependent assignment problem with a convex agent cost function. Eur. J. Oper. Res. 261(2): 486-502 (2017) - 2016
- [j13]Arik Senderovich, Matthias Weidlich, Liron Yedidsion, Avigdor Gal, Avishai Mandelbaum, Sarah Kadish, Craig A. Bunnell:
Conformance Checking and Performance Improvement in Scheduled Processes: A Queueing-Network Perspective. EMISA Forum 36(2): 57-59 (2016) - [j12]Arik Senderovich, Matthias Weidlich, Liron Yedidsion, Avigdor Gal, Avishai Mandelbaum, Sarah Kadish, Craig A. Bunnell:
Conformance checking and performance improvement in scheduled processes: A queueing-network perspective. Inf. Syst. 62: 185-206 (2016) - [c5]Arik Senderovich, Matthias Weidlich, Liron Yedidsion, Avigdor Gal, Avishai Mandelbaum, Sarah Kadish, Craig A. Bunnell:
Conformance Checking and Performance Improvement in Scheduled Processes: A Queueing-Network Perspective (Extended Abstract). EMISA 2016: 72-74 - [c4]Ilan Tchernowitz, Liron Yedidsion, Roi Reichart:
Effective Greedy Inference for Graph-based Non-Projective Dependency Parsing. EMNLP 2016: 711-720 - 2015
- [j11]Miri Gilenson, Michael Hassoun, Liron Yedidsion:
Setting defect charts control limits to balance cycle time and yield for a tandem production line. Comput. Oper. Res. 53: 301-308 (2015) - [j10]Dvir Shabtay, George Steiner, Liron Yedidsion:
A pseudo-polynomial time algorithm for solving the resource dependent assignment problem. Discret. Appl. Math. 182: 115-121 (2015) - [i1]Tamar Cohen, Liron Yedidsion:
The Periodic Joint Replenishment Problem is Strongly NP-Hard. CoRR abs/1511.02454 (2015) - 2014
- [c3]Miri Gilenson, Liron Yedidsion, Michael Hassoun:
Setting quality control requirements to balance between cycle time and yield inasemiconductor production line. WSC 2014: 2422-2433 - 2013
- [j9]Retsef Levi, Liron Yedidsion:
NP-hardness proof for the assembly problem with stationary setup and additive holding costs. Oper. Res. Lett. 41(2): 134-137 (2013) - 2012
- [j8]Dvir Shabtay, Nufar Gaspar, Liron Yedidsion:
A bicriteria approach to scheduling a single machine with job rejection and positional penalties. J. Comb. Optim. 23(4): 395-424 (2012) - [j7]Liron Yedidsion:
Bi-criteria and tri-criteria analysis to minimize maximum lateness makespan and resource consumption for scheduling a single machine. J. Sched. 15(6): 665-679 (2012) - [c2]Miri Gilenson, Liron Yedidsion, Michael Hassoun:
Setting quality control requirements to balance cycle time and yield: the single machine case. WSC 2012: 191:1-191:9 - 2011
- [j6]Liron Yedidsion, Dvir Shabtay, Moshe Kaspi:
Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling. Discret. Appl. Math. 159(12): 1264-1278 (2011) - 2010
- [j5]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) - [j4]Yoram Revah, Michael Segal, Liron Yedidsion:
Real-time data gathering in sensor networks. Discret. Appl. Math. 158(5): 543-550 (2010) - [j3]Dvir Shabtay, George Steiner, Liron Yedidsion:
Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments. Discret. Appl. Math. 158(10): 1090-1103 (2010) - [j2]Yaron Leyvand, Dvir Shabtay, George Steiner, Liron Yedidsion:
Just-in-time scheduling with controllable processing times on parallel machines. J. Comb. Optim. 19(3): 347-368 (2010)
2000 – 2009
- 2007
- [j1]Liron Yedidsion, Dvir Shabtay, Moshe Kaspi:
A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine. J. Sched. 10(6): 341-352 (2007) - [c1]Yoram Revah, Michael Segal, Liron Yedidsion:
On Real Time Data-Gathering in Sensor Networks. MASS 2007: 1-6
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 2024-04-24 23:13 CEST 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:
