Dvir Shabtay
Orcid: 0000-0002-2709-599X
According to our database1,
Dvir Shabtay
authored at least 71 papers
between 2004 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
A new perspective on single-machine scheduling problems with late work related criteria.
Ann. Oper. Res., March, 2023
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023
2022
ACM Trans. Algorithms, 2022
On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates.
J. Sched., 2022
A general scheme for solving a large set of scheduling problems with rejection in FPT time.
J. Sched., 2022
Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work.
Eur. J. Oper. Res., 2022
Single-machine scheduling with machine unavailability periods and resource dependent processing times.
Eur. J. Oper. Res., 2022
CoRR, 2022
Comput. Ind. Eng., 2022
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022
2021
Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates.
J. Sched., 2021
J. Oper. Res. Soc., 2021
Eur. J. Oper. Res., 2021
Heuristic algorithms for solving a set of NP-hard single-machine scheduling problems with resource-dependent processing times.
Comput. Ind. Eng., 2021
Ann. Oper. Res., 2021
Scheduling in multi-scenario environment with an agreeable condition on job processing times.
Ann. Oper. Res., 2021
2020
2019
J. Sched., 2019
OR Spectr., 2019
Eur. J. Oper. Res., 2019
2018
Single machine scheduling to minimise resource consumption cost with a bound on scheduling plus due date assignment penalties.
Int. J. Prod. Res., 2018
2017
Eur. J. Oper. Res., 2017
Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times.
Eur. J. Oper. Res., 2017
CoRR, 2017
Scheduling Two Agents on a Single Machine: A Parameterized Analysis of NP-hard Problems.
CoRR, 2017
2016
Single machine scheduling with two competing agents, arbitrary release dates and unit processing times.
Ann. Oper. Res., 2016
2015
J. Sched., 2015
Eur. J. Oper. Res., 2015
A pseudo-polynomial time algorithm for solving the resource dependent assignment problem.
Discret. Appl. Math., 2015
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015
2014
The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost.
Eur. J. Oper. Res., 2014
2013
Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times.
J. Sched., 2013
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., 2013
Comput. Oper. Res., 2013
2012
Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems.
J. Sched., 2012
A bicriteria approach to scheduling a single machine with job rejection and positional penalties.
J. Comb. Optim., 2012
Eur. J. Oper. Res., 2012
An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times.
Discret. Optim., 2012
Online scheduling of two job types on a set of multipurpose machines with unit processing times.
Comput. Oper. Res., 2012
2011
A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates.
J. Sched., 2011
J. Sched., 2011
On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices.
J. Heuristics, 2011
Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling.
Discret. Appl. Math., 2011
Detection and improvement of deficiencies and failures in public-transportation networks using agent-enhanced distribution data mining.
Proceedings of the 2011 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), 2011
2010
J. Comb. Optim., 2010
A unified approach for scheduling with convex resource consumption functions using positional penalties.
Eur. J. Oper. Res., 2010
Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments.
Discret. Appl. Math., 2010
Optimal due date assignment and resource allocation in a group technology scheduling environment.
Comput. Oper. Res., 2010
2008
J. Sched., 2008
Due date assignments and scheduling a single machine with a general earliness/tardiness cost function.
Comput. Oper. Res., 2008
The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times.
Ann. Oper. Res., 2008
2007
A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine.
J. Sched., 2007
Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine.
Manuf. Serv. Oper. Manag., 2007
Discret. Appl. Math., 2007
2006
Oper. Res. Lett., 2006
Eur. J. Oper. Res., 2006
A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates.
Comput. Oper. Res., 2006
2004
Minimizing the total weighted flow time in a single machine with controllable processing times.
Comput. Oper. Res., 2004
Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine.
Comput. Oper. Res., 2004
Convex resource allocation for minimizing the makespan in a single machine with job release dates.
Comput. Oper. Res., 2004