default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEugene Levner
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j51]Eugene Levner, Vladimir Kats, Pengyu Yan, Ada Che:
Fast Algorithm for High-Throughput Screening Scheduling Based on the PERT/CPM Project Management Technique. Algorithms 17(3): 127 (2024)- [j50]Vladimir Kats, Eugene Levner:
Maximizing the Average Environmental Benefit of a Fleet of Drones under a Periodic Schedule of Tasks. Algorithms 17(7): 283 (2024) - [j49]Alexander Ptuskin
, Eugene Levner, Vladimir Kats:
Cyclic multi-hoist scheduling with fuzzy processing times in flexible manufacturing lines. Appl. Soft Comput. 165: 112014 (2024) - [j48]Kaize Yu, Pengyu Yan, Xiang T. R. Kong, Liu Yang, Eugene Levner:
Sequential auction for cloud manufacturing resource trading: A deep reinforcement learning approach to the lot-sizing problem. Comput. Ind. Eng. 188: 109862 (2024) - [j47]Jianguang Feng, Ada Che, Chengbin Chu, Eugene Levner, Vladimir Kats:
Scheduling robotic cells with fixed processing times or time windows: Classification, solution approaches, polynomial algorithms and complexity. Eur. J. Oper. Res. 319(2): 468-483 (2024) - 2021
- [j46]Chi To Ng, T. C. E. Cheng, Eugene Levner, Boris Kriheli:
Optimal bi-criterion planning of rescue and evacuation operations for marine accidents using an iterative scheduling algorithm. Ann. Oper. Res. 296(1): 407-420 (2021) - [j45]T. C. E. Cheng, Boris Kriheli, Eugene Levner, C. T. Ng:
Scheduling an autonomous robot searching for hidden targets. Ann. Oper. Res. 298(1): 95-109 (2021) - [c27]Eugene Levner, Vladimir M. Vishnevsky:
Recent Advances in Scheduling Theory and Applications in Robotics and Communications. DCCN 2021: 14-23 - 2020
- [c26]Eugene Levner, Boris Kriheli, Arriel Benis, Alexander Ptuskin, Amir Elalouf, Sharon Hovav, Shai Ashkenazi:
Entropy-Based Approach to Efficient Cleaning of Big Data in Hierarchical Databases. BigData 2020: 3-12
2010 – 2019
- 2018
- [j44]Boris Kriheli, Eugene Levner:
Entropy-Based Algorithm for Supply-Chain Complexity Assessment. Algorithms 11(4): 35 (2018) - [j43]C. T. Ng, T. C. E. Cheng, Dmitry Tsadikovich, Eugene Levner, Amir Elalouf, Sharon Hovav:
A multi-criterion approach to optimal vaccination planning: Method and solution. Comput. Ind. Eng. 126: 637-649 (2018) - [j42]Vladimir Kats, Eugene Levner:
On the existence of dominating 6-cyclic schedules in four-machine robotic cells. Eur. J. Oper. Res. 268(2): 755-759 (2018) - [j41]Eugene Levner, Alexander Ptuskin:
Entropy-based model for the ripple effect: managing environmental risks in supply chains. Int. J. Prod. Res. 56(7): 2539-2551 (2018) - [j40]Pengyu Yan, Ada Che, Eugene Levner, Shi Qiang Liu:
A Heuristic for Inserting Randomly Arriving Jobs Into an Existing Hoist Schedule. IEEE Trans Autom. Sci. Eng. 15(3): 1423-1430 (2018) - [c25]Amir Elalouf, Dmitry Tsadikovich, Eugene Levner:
A location-routing problem within blood sample collection chains. CoDIT 2018: 488-491 - 2017
- [j39]Ada Che, Vladimir Kats, Eugene Levner:
An efficient bicriteria algorithm for stable robotic flow shop scheduling. Eur. J. Oper. Res. 260(3): 964-971 (2017) - [c24]T. C. E. Cheng, C. T. Ng, Eugene Levner, Boris Kriheli:
A Fast Algorithm for Detecting Hidden Objects by Smart Mobile Robots. SMARTCOMP 2017: 1-6 - 2016
- [j38]Amir Elalouf, Eugene Levner:
Improving the solution complexity of the scheduling problem with deadlines: A general technique. RAIRO Oper. Res. 50(4-5): 681-687 (2016) - 2015
- [j37]Boris Kriheli, Eugene Levner, Michael Bendersky, Eduard H. Yakubov:
A Fast Algorithm for Scheduling Detection-and-Rescue Operations Based on Data from Wireless Sensor Networks. Res. Comput. Sci. 104: 9-21 (2015) - [c23]Ada Che, Ke Lv, Eugene Levner, Vladimir Kats:
Energy consumption minimization for single machine scheduling with bounded maximum tardiness. ICNSC 2015: 146-150 - 2014
- [j36]Huajun Tang, Amir Elalouf, Eugene Levner, T. C. E. Cheng:
Efficient computation of evacuation routes on a three-dimensional geometric network. Comput. Ind. Eng. 76: 231-242 (2014) - [c22]Alexey An, Bakytkan Dauletbakov, Eugene Levner:
Multi-attribute Classification of Text Documents as a Tool for Ranking and Categorization of Educational Innovation Projects. CICLing (2) 2014: 404-416 - [c21]Eugene Levner, Amir Elalouf:
An improved approximation algorithm for the ancient scheduling problem with deadlines. CoDIT 2014: 113-116 - [c20]Eugene Levner, Boris Kriheli, Amir Elalouf, Dmitry Tsadikovich:
A Fast Scheduling Algorithm for Detection and Localization of Hidden Objects Based on Data Gathering in Wireless Sensor Networks. MICAI (2) 2014: 436-450 - 2013
- [j35]Vladimir Kats, Eugene Levner:
A note on periodic schedules for linear precedence constraints. Discret. Appl. Math. 161(3): 430-434 (2013) - [j34]Amir Elalouf, Eugene Levner, T. C. E. Cheng:
Efficient Routing of Mobile Agents in a Stochastic Network. Polibits 47: 61-66 (2013) - [j33]Amir Elalouf, Eugene Levner, Huajun Tang:
An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem. J. Sched. 16(4): 429-435 (2013) - [c19]Eugene Levner, Boris Kriheli:
Optimal Search and Detection of Clustered Hidden Targets under Imperfect Inspections. MIM 2013: 1656-1661 - [c18]Boris Kriheli, Eugene Levner, Alexander Spivak:
Optimization Model of Routing-And-Searching Process Performed by Unmanned Aerial Vehicles in Special Target-Detection Operations. MIM 2013: 1838-1842 - 2012
- [j32]Vladimir Kats, Eugene Levner:
Cyclic Flowshop Scheduling with Operators and Robots: Vyacheslav Tanaev's Vision and Lasting Contributions. J. Sched. 15(4): 419-425 (2012) - [c17]Boris Kriheli, Eugene Levner:
Search and Detection of Failed Components in Repairable Complex Systems under Imperfect Inspections. MICAI (2) 2012: 399-410 - [c16]Eugene Levner, Amir Elalouf, Huajun Tang:
A Multi-agent Scheduling Model for Maximizing Agent Satisfaction. MIWAI 2012: 90-100 - 2011
- [j31]Vladimir Kats, Eugene Levner:
Cyclic routing algorithms in graphs: Performance analysis and applications to robot scheduling. Comput. Ind. Eng. 61(2): 279-288 (2011) - [j30]Vladimir Kats, Eugene Levner:
A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times. Eur. J. Oper. Res. 209(1): 51-56 (2011) - [j29]Eugene Levner, Amir Elalouf, T. C. Edwin Cheng:
An Improved FPTAS for Mobile Agent Routing with Time Constraints. J. Univers. Comput. Sci. 17(13): 1854-1862 (2011) - [j28]Vladimir Kats, Eugene Levner:
Parametric algorithms for 2-cyclic robot scheduling with interval processing times. J. Sched. 14(3): 267-279 (2011) - [c15]Amir Elalouf, Eugene Levner, T. C. Edwin Cheng:
Efficient Routing of Mobile Agents for Agent-Based Integrated Enterprise Management: A General Acceleration Technique. EOMAS 2011: 1-20 - [c14]Eugene Levner, Avishai Ceder, Amir Elalouf, Yuval Hadas, Dvir Shabtay:
Detection and improvement of deficiencies and failures in public-transportation networks using agent-enhanced distribution data mining. IEEM 2011: 694-698 - [c13]Amir Elalouf, Eugene Levner, T. C. Edwin Cheng:
Computing Mobile Agent Routes with Node-Wise Constraints in Distributed Communication Systems. MICAI (1) 2011: 76-87 - 2010
- [j27]Eugene Levner, Vladimir Kats, David Alcaide López de Pablo, T. C. Edwin Cheng:
Complexity of cyclic scheduling problems: A state-of-the-art survey. Comput. Ind. Eng. 59(2): 352-361 (2010) - [c12]Dmitry Tsadikovich, Eugene Levner, Hanan Tell:
AI-Based Integrated Scheduling of Production and Transportation Operations within Military Supply Chains. MICAI (1) 2010: 209-220
2000 – 2009
- 2009
- [j26]Vladimir Kats, Eugene Levner:
A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case. Discret. Appl. Math. 157(2): 339-355 (2009) - [j25]Eugene Levner:
J. Blazewicz, K. Ecker, E. Pesch, G. Schmidt, J. Weglarz: Handbook on scheduling: from theory to applications. J. Sched. 12(4): 433-434 (2009) - [j24]Ada Che, Vladimir Kats, Eugene Levner:
A note on a quadratic algorithm for the 2-cyclic robotic scheduling problem. Theor. Comput. Sci. 410(47-49): 5188-5190 (2009) - 2008
- [j23]Vladimir Kats, Lei Lei, Eugene Levner:
Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints. Eur. J. Oper. Res. 187(3): 1196-1211 (2008) - [c11]Vladimir Kats, Eugene Levner:
Parametric Algorithms for Cyclic Scheduling Problems with Applications to Robotics. MICAI 2008: 653-663 - 2007
- [j22]David Alcaide, Chengbin Chu, Vladimir Kats, Eugene Levner, Gerard Sierksma:
Cyclic multiple-robot scheduling with time-window constraints using a critical path approach. Eur. J. Oper. Res. 177(1): 147-162 (2007) - [c10]Eugene Levner, David Pinto, Paolo Rosso, David Alcaide, R. R. K. Sharma:
Fuzzifying Clustering Algorithms: The Case Study of MajorClust. MICAI 2007: 821-830 - [c9]Eugene Levner, David Alcaide, Joaquin Sicilia:
Multi-attribute Text Classification Using the Fuzzy Borda Method and Semantic Grades. WILF 2007: 422-429 - 2006
- [j21]Janny May-Yee Leung, Eugene Levner:
An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times. Oper. Res. Lett. 34(4): 465-472 (2006) - [c8]Sergey Frenkel, Eugene Levner, Victor N. Zakharov:
Characterization of probabilistic faults diagnostic models. ITRE 2006: 156-160 - [c7]Vladimir Kats, Eugene Levner:
A Polynomial Algorithm for 2-Cyclic Robotic Scheduling. MICAI 2006: 439-449 - 2004
- [j20]Pedro Mejía-Alvarez, Eugene Levner, Daniel Mossé:
Adaptive scheduling server for power-aware real-time tasks. ACM Trans. Embed. Comput. Syst. 3(2): 284-306 (2004) - 2003
- [j19]Ada Che, Chengbin Chu, Eugene Levner:
A polynomial algorithm for 2-degree cyclic robot scheduling. Eur. J. Oper. Res. 145(1): 31-44 (2003) - 2002
- [j18]Kunihiko Hiraishi, Eugene Levner, Milan Vlach:
Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs. Comput. Oper. Res. 29(7): 841-848 (2002) - [j17]David Blokh, Eugene Levner:
An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices. Discret. Appl. Math. 119(1-2): 139-148 (2002) - [j16]George M. Adelson-Velsky, Eugene Levner:
Project Scheduling in AND-OR Graphs: A Generalization of Dijkstra's Algorithm. Math. Oper. Res. 27(3): 504-517 (2002) - [c6]Pedro Mejía-Alvarez, Eugene Levner, Daniel Mossé:
An Integrated Heuristic Approach to Power-Aware Real-Time Scheduling. PACS 2002: 68-83 - [c5]Pedro Mejía-Alvarez, Eugene Levner, Daniel Mossé:
Power-Optimized Scheduling Server for Real-Time Tasks. IEEE Real Time Technology and Applications Symposium 2002: 239-250 - 2001
- [j15]David Blokh, Eugene Levner:
The Maximum Traveling Salesman Problem on Banded Matrices. Int. J. Found. Comput. Sci. 12(6): 809-819 (2001) - 2000
- [j14]Yves Crama, Vladimir Kats, Joris van de Klundert, Eugene Levner:
Cyclic scheduling in robotic flowshops. Ann. Oper. Res. 96(1-4): 97-124 (2000) - [j13]Fabrice Chauvet, Eugene Levner, Leonid K. Meyzin, Jean-Marie Proth:
On-line scheduling in a surface treatment system. Eur. J. Oper. Res. 120(2): 382-392 (2000)
1990 – 1999
- 1999
- [j12]Konstantin Kogan, Eugene Levner:
Optimal control of assembling complexes underpredetermined maintenance conditions. Ann. Oper. Res. 91: 49-62 (1999) - [j11]Vladimir Kats, Eugene Levner, Leonid K. Meyzin:
Multiple-part cyclic hoist scheduling using a sieve method. IEEE Trans. Robotics Autom. 15(4): 704-713 (1999) - 1998
- [j10]Konstantin Kogan, Eugene Levner:
A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots. Comput. Oper. Res. 25(1): 53-62 (1998) - [j9]Eugene Levner, Vladimir Kats:
A Parametric Critical Path Problem and an Application for Cyclic Scheduling. Discret. Appl. Math. 87(1-3): 149-158 (1998) - [j8]Vladimir Kats, Eugene Levner:
Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case. Eur. J. Oper. Res. 107(2): 371-377 (1998) - [j7]Eugene Levner, Leonid K. Meyzin, Alexander Ptuskin:
Periodic scheduling of a transporting robot under incomplete input data: A fuzzy approach. Fuzzy Sets Syst. 98(3): 255-266 (1998) - [j6]George Gens, Eugene Levner:
An Approximate Binary Search Algorithm for the Multiple-Choice Knapsack Problem. Inf. Process. Lett. 67(5): 261-265 (1998) - 1997
- [j5]Vladimir Kats, Eugene Levner:
Minimizing the number of robots to meet a given cyclic schedule. Ann. Oper. Res. 69: 209-226 (1997) - [j4]Vladimir Kats, Eugene Levner:
A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling. Oper. Res. Lett. 21(4): 171-179 (1997) - 1995
- [j3]Eugene Levner, Konstantin Kogan, Ilya Levin:
Scheduling a two-machine robotic cell: A solvable case. Ann. Oper. Res. 57(1): 217-232 (1995) - [c4]Eugene Levner, Leonid K. Meyzin, Alexander Ptuskin:
Fuzzy Reasoning and Applications for Intelligent Scheduling of Robots. Fuzzy Logic in Artificial Intelligence 1995: 57-68 - 1993
- [c3]Eugene Levner, Dror Zuckerman, George Gens, Alexander Ptuskin:
Optimal strategies for the preventive maintenance of real-time repairable systems. System Modelling and Optimization 1993: 957-966 - 1990
- [c2]A. A. Fridman, Eugene Levner:
A Survey of Some Results in Discrete Optimisation. IPCO 1990: 231-235
1980 – 1989
- 1981
- [j2]George Gens, Eugene Levner:
Fast approximation algorithm for job sequencing with deadlines. Discret. Appl. Math. 3(4): 313-318 (1981) - 1980
- [j1]George Gens, Eugene Levner:
Complexity of approximation algorithms for combinatorial problems: a survey. SIGACT News 12(3): 52-65 (1980)
1970 – 1979
- 1979
- [c1]George Gens, Eugene Levner:
Computational Complexity of Approximation Algorithms for Combinatorial Problems. MFCS 1979: 292-300
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-12-10 20:52 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:
