Dvir Shabtay

Orcid: 0000-0002-2709-599X

According to our database1, Dvir Shabtay authored at least 77 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times.
J. Sched., June, 2024

On the parameterized complexity of interval scheduling with eligible machine sets.
J. Comput. Syst. Sci., 2024

Minimizing the Weighted Number of Tardy Jobs via (max,+)-Convolutions.
INFORMS J. Comput., 2024

Coordinating scheduling and rejection decisions in a two-machine flow shop scheduling problem.
Eur. J. Oper. Res., 2024

Fair Repetitive Interval Scheduling.
CoRR, 2024

Minimizing the Number of Tardy Jobs and Maximal Tardiness on a Single Machine is NP-hard.
CoRR, 2024

No Polynomial Kernels for Knapsack.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023
A new perspective on single-machine scheduling problems with late work related criteria.
Ann. Oper. Res., March, 2023

Equitable scheduling on a single machine.
J. Sched., 2023

A state-of-the-art survey on multi-scenario scheduling.
Eur. J. Oper. Res., 2023

Single Machine Scheduling with Few Deadlines.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

2022
SETH-based Lower Bounds for Subset Sum and Bicriteria Path.
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

Scheduling lower bounds via AND subset sum.
J. Comput. Syst. Sci., 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

Single Machine Weighted Number of Tardy Jobs Minimization With Small Weights.
CoRR, 2022

Single-machine scheduling with total late work and job rejection.
Comput. Ind. Eng., 2022

Faster Minimization of Tardy Processing Time on a Single Machine.
Algorithmica, 2022

Hardness of Interval Scheduling on Unrelated Machines.
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

Multi-scenario scheduling to maximise the weighted number of just-in-time jobs.
J. Oper. Res. Soc., 2021

Minimizing total late work on a single machine with generalized due-dates.
Eur. J. Oper. Res., 2021

Equitable Scheduling for the Total Completion Time Objective.
CoRR, 2021

Heuristic algorithms for solving a set of NP-hard single-machine scheduling problems with resource-dependent processing times.
Comput. Ind. Eng., 2021

New algorithms for minimizing the weighted number of tardy jobs on a single machine.
Ann. Oper. Res., 2021

Scheduling in multi-scenario environment with an agreeable condition on job processing times.
Ann. Oper. Res., 2021

2020
Parameterized Multi-Scenario Single-Machine Scheduling Problems.
Algorithmica, 2020

2019
On the parameterized tractability of the just-in-time flow-shop scheduling problem.
J. Sched., 2019

Bi-criteria path problem with minimum length and maximum survival probability.
OR Spectr., 2019

On the parameterized tractability of single machine scheduling with rejection.
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
The resource dependent assignment problem with a convex agent cost function.
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

New Algorithms for Minimizing the Weighted Number of Tardy Jobs On a Single Machine.
CoRR, 2017

Scheduling Two Agents on a Single Machine: A Parameterized Analysis of NP-hard Problems.
CoRR, 2017

2016
Proportionate flow-shop scheduling with rejection.
J. Oper. Res. Soc., 2016

Optimal restricted due date assignment in scheduling.
Eur. J. Oper. Res., 2016

Single machine scheduling with two competing agents, arbitrary release dates and unit processing times.
Ann. Oper. Res., 2016

2015
Multipurpose machine scheduling with rejection and identical job processing times.
J. Sched., 2015

Erratum to: A survey on offline scheduling with rejection.
J. Sched., 2015

Single machine scheduling with two competing agents and equal job processing times.
Eur. J. Oper. Res., 2015

A pseudo-polynomial time algorithm for solving the resource dependent assignment problem.
Discret. Appl. Math., 2015

Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs.
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
A survey on offline scheduling with rejection.
J. Sched., 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

A note: Minmax due-date assignment problem with lead-time cost.
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

The just-in-time scheduling problem in a flow-shop scheduling system.
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

Two-machine flow-shop scheduling with rejection.
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

Scheduling unit length jobs on parallel machines with lookahead information.
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
Just-in-time scheduling with controllable processing times on parallel machines.
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
Optimal due date assignment in multi-machine scheduling environments.
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

A survey of scheduling with controllable processing times.
Discret. Appl. Math., 2007

2006
Two due date assignment problems in scheduling a single machine.
Oper. Res. Lett., 2006

Parallel machine scheduling with a convex resource consumption function.
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


  Loading...