default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDvir Shabtay
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j67]Dvir Shabtay
, Enrique Gerstl:
Coordinating scheduling and rejection decisions in a two-machine flow shop scheduling problem. Eur. J. Oper. Res. 316(3): 887-898 (2024)- [j66]Danny Hermelin, Hendrik Molter, Dvir Shabtay:
Minimizing the Weighted Number of Tardy Jobs via (max,+)-Convolutions. INFORMS J. Comput. 36(3): 836-848 (2024) - [j65]Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay:
On the parameterized complexity of interval scheduling with eligible machine sets. J. Comput. Syst. Sci. 144: 103533 (2024) - [j64]Dvir Shabtay, Baruch Mor:
Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times. J. Sched. 27(3): 239-256 (2024) - [c9]Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay:
No Polynomial Kernels for Knapsack. ICALP 2024: 83:1-83:17 - [i13]Klaus Heeger, Danny Hermelin, Michael L. Pinedo, Dvir Shabtay:
Minimizing the Number of Tardy Jobs and Maximal Tardiness on a Single Machine is NP-hard. CoRR abs/2404.02784 (2024) - [i12]Klaus Heeger, Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay:
Fair Repetitive Interval Scheduling. CoRR abs/2407.03987 (2024) - 2023
- [j63]Dvir Shabtay:
A new perspective on single-machine scheduling problems with late work related criteria. Ann. Oper. Res. 322(2): 947-966 (2023) - [j62]Dvir Shabtay, Miri Gilenson:
A state-of-the-art survey on multi-scenario scheduling. Eur. J. Oper. Res. 310(1): 3-23 (2023) - [j61]Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay:
Equitable scheduling on a single machine. J. Sched. 26(2): 209-225 (2023) - [c8]Klaus Heeger, Danny Hermelin, Dvir Shabtay:
Single Machine Scheduling with Few Deadlines. IPEC 2023: 24:1-24:15 - [i11]Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay:
No Polynomial Kernels for Knapsack. CoRR abs/2308.12593 (2023) - 2022
- [j60]Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz:
Faster Minimization of Tardy Processing Time on a Single Machine. Algorithmica 84(5): 1341-1356 (2022) - [j59]Baruch Mor, Dvir Shabtay:
Single-machine scheduling with total late work and job rejection. Comput. Ind. Eng. 169: 108168 (2022) - [j58]Dvir Shabtay:
Single-machine scheduling with machine unavailability periods and resource dependent processing times. Eur. J. Oper. Res. 296(2): 423-439 (2022) - [j57]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) - [j56]Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay:
Scheduling lower bounds via AND subset sum. J. Comput. Syst. Sci. 127: 29-40 (2022) - [j55]Danny Hermelin, Dvir Shabtay, Chen Zelig, Michael L. Pinedo:
A general scheme for solving a large set of scheduling problems with rejection in FPT time. J. Sched. 25(2): 229-255 (2022) - [j54]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) - [j53]Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay:
SETH-based Lower Bounds for Subset Sum and Bicriteria Path. ACM Trans. Algorithms 18(1): 6:1-6:22 (2022) - [c7]Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay:
Hardness of Interval Scheduling on Unrelated Machines. IPEC 2022: 18:1-18:16 - [i10]Danny Hermelin, Hendrik Molter, Dvir Shabtay:
Single Machine Weighted Number of Tardy Jobs Minimization With Small Weights. CoRR abs/2202.06841 (2022) - [i9]Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay:
Hardness of Interval Scheduling on Unrelated Machines. CoRR abs/2206.12825 (2022) - 2021
- [j52]Danny Hermelin, Shlomo Karhi, Michael L. Pinedo, Dvir Shabtay:
New algorithms for minimizing the weighted number of tardy jobs on a single machine. Ann. Oper. Res. 298(1): 271-287 (2021) - [j51]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) - [j50]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) - [j49]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) - [j48]Miri Gilenson, Dvir Shabtay:
Multi-scenario scheduling to maximise the weighted number of just-in-time jobs. J. Oper. Res. Soc. 72(8): 1762-1779 (2021) - [j47]Baruch Mor, Gur Mosheiov, Dvir Shabtay:
Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates. J. Sched. 24(6): 553-567 (2021) - [c6]Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay:
Equitable Scheduling on a Single Machine. AAAI 2021: 11818-11825 - [i8]Danny Hermelin, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay:
Equitable Scheduling for the Total Completion Time Objective. CoRR abs/2112.13824 (2021) - 2020
- [j46]Danny Hermelin, George Manoussakis, Michael L. Pinedo, Dvir Shabtay, Liron Yedidsion:
Parameterized Multi-Scenario Single-Machine Scheduling Problems. Algorithmica 82(9): 2644-2667 (2020) - [c5]Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay:
Scheduling Lower Bounds via AND Subset Sum. ICALP 2020: 4:1-4:15 - [c4]Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz:
Faster Minimization of Tardy Processing Time on a Single Machine. ICALP 2020: 19:1-19:12 - [i7]Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz:
Faster Minimization of Tardy Processing Time on a Single Machine. CoRR abs/2003.07104 (2020) - [i6]Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay:
Scheduling Lower Bounds via AND Subset Sum. CoRR abs/2003.07113 (2020) - [i5]Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay:
Equitable Scheduling on a Single Machine. CoRR abs/2010.04643 (2020)
2010 – 2019
- 2019
- [j45]Danny Hermelin, Michael L. Pinedo, Dvir Shabtay, Nimrod Talmon:
On the parameterized tractability of single machine scheduling with rejection. Eur. J. Oper. Res. 273(1): 67-73 (2019) - [j44]Nir Halman, Mikhail Y. Kovalyov, Alain Quilliot, Dvir Shabtay, Moshe Zofi:
Bi-criteria path problem with minimum length and maximum survival probability. OR Spectr. 41(2): 469-489 (2019) - [j43]Danny Hermelin, Dvir Shabtay, Nimrod Talmon:
On the parameterized tractability of the just-in-time flow-shop scheduling problem. J. Sched. 22(6): 663-676 (2019) - [c3]Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay:
SETH-Based Lower Bounds for Subset Sum and Bicriteria Path. SODA 2019: 41-57 - 2018
- [j42]Shlomo Karhi, Dvir Shabtay:
Single machine scheduling to minimise resource consumption cost with a bound on scheduling plus due date assignment penalties. Int. J. Prod. Res. 56(9): 3080-3096 (2018) - 2017
- [j41]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) - [j40]Liron Yedidsion, Dvir Shabtay:
The resource dependent assignment problem with a convex agent cost function. Eur. J. Oper. Res. 261(2): 486-502 (2017) - [i4]Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay:
SETH-Based Lower Bounds for Subset Sum and Bicriteria Path. CoRR abs/1704.04546 (2017) - [i3]Danny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay, Nimrod Talmon, Gerhard J. Woeginger:
Scheduling Two Agents on a Single Machine: A Parameterized Analysis of NP-hard Problems. CoRR abs/1709.04161 (2017) - [i2]Danny Hermelin, Dvir Shabtay, Nimrod Talmon:
On The Parameterized Tractability of the Just-In-Time Flow-Shop Scheduling Problem. CoRR abs/1709.04169 (2017) - [i1]Danny Hermelin, Shlomo Karhi, Mike Pinedo, Dvir Shabtay:
New Algorithms for Minimizing the Weighted Number of Tardy Jobs On a Single Machine. CoRR abs/1709.05751 (2017) - 2016
- [j39]Omri Dover, Dvir Shabtay:
Single machine scheduling with two competing agents, arbitrary release dates and unit processing times. Ann. Oper. Res. 238(1-2): 145-178 (2016) - [j38]Dvir Shabtay:
Optimal restricted due date assignment in scheduling. Eur. J. Oper. Res. 252(1): 79-89 (2016) - [j37]Dvir Shabtay, Daniel Oron:
Proportionate flow-shop scheduling with rejection. J. Oper. Res. Soc. 67(5): 752-769 (2016) - 2015
- [j36]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) - [j35]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) - [j34]Dvir Shabtay, Shlomo Karhi, Daniel Oron:
Multipurpose machine scheduling with rejection and identical job processing times. J. Sched. 18(1): 75-88 (2015) - [j33]Dvir Shabtay, Nufar Gaspar, Moshe Kaspi:
Erratum to: A survey on offline scheduling with rejection. J. Sched. 18(3): 329 (2015) - [c2]Danny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay, Nimrod Talmon, Gerhard J. Woeginger:
Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs. IPEC 2015: 55-65 - 2014
- [j32]Dvir Shabtay:
The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost. Eur. J. Oper. Res. 233(1): 64-74 (2014) - 2013
- [j31]Baruch Mor, Gur Mosheiov, Dvir Shabtay:
A note: Minmax due-date assignment problem with lead-time cost. Comput. Oper. Res. 40(8): 2161-2164 (2013) - [j30]Shlomo Karhi, Dvir Shabtay:
On the optimality of the TLS algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines. J. Comb. Optim. 26(1): 198-222 (2013) - [j29]Dvir Shabtay, Nufar Gaspar, Moshe Kaspi:
A survey on offline scheduling with rejection. J. Sched. 16(1): 3-28 (2013) - [j28]Gur Mosheiov, Dvir Shabtay:
Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times. J. Sched. 16(5): 519-527 (2013) - 2012
- [j27]Dvir Shabtay, Shlomo Karhi:
Online scheduling of two job types on a set of multipurpose machines with unit processing times. Comput. Oper. Res. 39(2): 405-412 (2012) - [j26]Dvir Shabtay, Nufar Gasper:
Two-machine flow-shop scheduling with rejection. Comput. Oper. Res. 39(5): 1087-1096 (2012) - [j25]Dvir Shabtay, Shlomo Karhi:
An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times. Discret. Optim. 9(4): 241-248 (2012) - [j24]Dvir Shabtay:
The just-in-time scheduling problem in a flow-shop scheduling system. Eur. J. Oper. Res. 216(3): 521-532 (2012) - [j23]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) - [j22]Dvir Shabtay, Yaron Bensoussan:
Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems. J. Sched. 15(1): 39-47 (2012) - 2011
- [j21]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) - [j20]Vladimir G. Deineko, Dvir Shabtay, George Steiner:
On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices. J. Heuristics 17(1): 61-96 (2011) - [j19]Marvin Mandelbaum, Dvir Shabtay:
Scheduling unit length jobs on parallel machines with lookahead information. J. Sched. 14(4): 335-350 (2011) - [j18]Dvir Shabtay, George Steiner:
A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates. J. Sched. 14(5): 455-469 (2011) - [c1]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 - 2010
- [j17]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) - [j16]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) - [j15]Yaron Leyvand, Dvir Shabtay, George Steiner:
A unified approach for scheduling with convex resource consumption functions using positional penalties. Eur. J. Oper. Res. 206(2): 301-312 (2010) - [j14]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
- 2008
- [j13]Dvir Shabtay, George Steiner:
The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times. Ann. Oper. Res. 159(1): 25-40 (2008) - [j12]Dvir Shabtay:
Due date assignments and scheduling a single machine with a general earliness/tardiness cost function. Comput. Oper. Res. 35(5): 1539-1545 (2008) - [j11]Dvir Shabtay, George Steiner:
Optimal due date assignment in multi-machine scheduling environments. J. Sched. 11(3): 217-228 (2008) - 2007
- [j10]Dvir Shabtay, George Steiner:
A survey of scheduling with controllable processing times. Discret. Appl. Math. 155(13): 1643-1666 (2007) - [j9]Dvir Shabtay, George Steiner:
Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine. Manuf. Serv. Oper. Manag. 9(3): 332-350 (2007) - [j8]Dvir Shabtay, George Steiner:
Single machine batch scheduling to minimize total completion time and resource consumption costs. J. Sched. 10(4-5): 255-261 (2007) - [j7]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) - 2006
- [j6]Moshe Kaspi, Dvir Shabtay:
A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates. Comput. Oper. Res. 33(10): 3015-3033 (2006) - [j5]Dvir Shabtay, Moshe Kaspi:
Parallel machine scheduling with a convex resource consumption function. Eur. J. Oper. Res. 173(1): 92-107 (2006) - [j4]Dvir Shabtay, George Steiner:
Two due date assignment problems in scheduling a single machine. Oper. Res. Lett. 34(6): 683-691 (2006) - 2004
- [j3]Dvir Shabtay:
Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine. Comput. Oper. Res. 31(8): 1303-1315 (2004) - [j2]Moshe Kaspi, Dvir Shabtay:
Convex resource allocation for minimizing the makespan in a single machine with job release dates. Comput. Oper. Res. 31(9): 1481-1489 (2004) - [j1]Dvir Shabtay, Moshe Kaspi:
Minimizing the total weighted flow time in a single machine with controllable processing times. Comput. Oper. Res. 31(13): 2279-2289 (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 2024-11-25 22:48 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:
