Dvir Shabtay

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Coordinating scheduling and resource allocation decisions in a proportionate flow-shop scheduling environment
Optimization Letters
2026-07-02Paper
Just-in-time scheduling in two-stage flexible flow shops
European Journal of Operational Research
2026-06-04Paper
Faster minimization of tardy processing time on a single machine2026-03-18Paper
Scheduling lower bounds via and subset sum2026-03-18Paper
No polynomial kernels for knapsack2026-01-14Paper
Fifty years of research in scheduling -- theory and applications
European Journal of Operational Research
2025-12-02Paper
Single machine scheduling with few deadlines2025-09-24Paper
Polynomial-time solutions for minimizing total load on unrelated machines with position-dependent processing times and rate-modifying activities
Journal of Scheduling
2025-09-23Paper
Fair repetitive interval scheduling
Algorithmica
2025-08-29Paper
Hardness of interval scheduling on unrelated machines2025-06-23Paper
Fairness in repetitive scheduling
European Journal of Operational Research
2025-05-20Paper
Scheduling problems on parallel machines with machine-dependent generalized due-dates
Annals of Operations Research
2025-05-15Paper
Minimizing the weighted number of tardy jobs via (,+)-convolutions
INFORMS Journal on Computing
2024-07-29Paper
Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times
Journal of Scheduling
2024-07-23Paper
Coordinating scheduling and rejection decisions in a two-machine flow shop scheduling problem
European Journal of Operational Research
2024-07-02Paper
On the parameterized complexity of interval scheduling with eligible machine sets
Journal of Computer and System Sciences
2024-07-01Paper
SETH-based Lower Bounds for Subset Sum and Bicriteria Path
ACM Transactions on Algorithms
2023-10-31Paper
Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system
Naval Research Logistics
2023-10-25Paper
No Polynomial Kernels for Knapsack2023-08-24Paper
A state-of-the-art survey on multi-scenario scheduling
European Journal of Operational Research
2023-07-11Paper
Equitable scheduling on a single machine
Journal of Scheduling
2023-06-27Paper
Equitable scheduling on a single machine
Journal of Scheduling
2023-06-27Paper
A new perspective on single-machine scheduling problems with late work related criteria
Annals of Operations Research
2023-06-26Paper
On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates
Journal of Scheduling
2022-11-04Paper
Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
European Journal of Operational Research
2022-06-10Paper
A general scheme for solving a large set of scheduling problems with rejection in FPT time
Journal of Scheduling
2022-05-27Paper
Faster minimization of tardy processing time on a single machine
Algorithmica
2022-05-03Paper
Scheduling lower bounds via AND subset sum
Journal of Computer and System Sciences
2022-04-04Paper
Scheduling in multi-scenario environment with an agreeable condition on job processing times
Annals of Operations Research
2022-01-24Paper
Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates
Journal of Scheduling
2022-01-14Paper
Single-machine scheduling with machine unavailability periods and resource dependent processing times
European Journal of Operational Research
2021-11-09Paper
Minimizing total late work on a single machine with generalized due-dates
European Journal of Operational Research
2021-06-07Paper
New algorithms for minimizing the weighted number of tardy jobs on a single machine
Annals of Operations Research
2021-05-05Paper
Parameterized multi-scenario single-machine scheduling problems
Algorithmica
2020-09-03Paper
On the parameterized tractability of the just-in-time flow-shop scheduling problem
Journal of Scheduling
2020-02-12Paper
Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
Applied Mathematical Modelling
2020-01-29Paper
Bi-criteria path problem with minimum length and maximum survival probability
OR Spectrum
2020-01-15Paper
SETH-based lower bounds for subset sum and bicriteria path
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-10-15Paper
On the parameterized tractability of single machine scheduling with rejection
European Journal of Operational Research
2018-10-30Paper
The resource dependent assignment problem with a convex agent cost function
European Journal of Operational Research
2018-05-29Paper
Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times
European Journal of Operational Research
2018-05-24Paper
Scheduling two competing agents when one agent has significantly fewer jobs2017-09-29Paper
Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
Just-in-Time Systems
2017-02-03Paper
A note: minmax due-date assignment problem with lead-time cost
Computers & Operations Research
2016-11-10Paper
Optimal restricted due date assignment in scheduling
European Journal of Operational Research
2016-10-07Paper
Single machine scheduling with two competing agents and equal job processing times
European Journal of Operational Research
2016-10-06Paper
The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
European Journal of Operational Research
2016-06-24Paper
Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
Annals of Operations Research
2016-04-20Paper
Erratum to: ``A survey on offline scheduling with rejection''
Journal of Scheduling
2015-07-28Paper
Multipurpose machine scheduling with rejection and identical job processing times
Journal of Scheduling
2015-03-26Paper
A pseudo-polynomial time algorithm for solving the resource dependent assignment problem
Discrete Applied Mathematics
2015-02-06Paper
A survey on offline scheduling with rejection
Journal of Scheduling
2014-08-18Paper
Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times
Journal of Scheduling
2014-08-18Paper
A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
Journal of Scheduling
2014-02-05Paper
Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
Journal of Scheduling
2014-02-05Paper
On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines
Journal of Combinatorial Optimization
2013-08-09Paper
An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
Discrete Optimization
2012-12-28Paper
Online scheduling of two job types on a set of multipurpose machines with unit processing times
Computers & Operations Research
2012-11-15Paper
Two-machine flow-shop scheduling with rejection
Computers & Operations Research
2012-11-15Paper
A bicriteria approach to scheduling a single machine with job rejection and positional penalties
Journal of Combinatorial Optimization
2012-07-17Paper
The just-in-time scheduling problem in a flow-shop scheduling system
European Journal of Operational Research
2012-05-14Paper
Scheduling unit length jobs on parallel machines with lookahead information
Journal of Scheduling
2012-01-16Paper
Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
Discrete Applied Mathematics
2011-08-10Paper
On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices
Journal of Heuristics
2011-02-14Paper
Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
Discrete Applied Mathematics
2010-10-11Paper
Optimal due date assignment and resource allocation in a group technology scheduling environment
Computers & Operations Research
2010-09-07Paper
Just-in-time scheduling with controllable processing times on parallel machines
Journal of Combinatorial Optimization
2010-06-11Paper
A unified approach for scheduling with convex resource consumption functions using positional penalties
European Journal of Operational Research
2010-06-11Paper
Single machine batch scheduling to minimize total completion time and resource consumption costs
Journal of Scheduling
2009-08-28Paper
Optimal due date assignment in multi-machine scheduling environments
Journal of Scheduling
2009-08-28Paper
A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
Journal of Scheduling
2008-11-10Paper
The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
Annals of Operations Research
2008-09-03Paper
Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
Computers & Operations Research
2007-11-06Paper
A survey of scheduling with controllable processing times
Discrete Applied Mathematics
2007-09-18Paper
Two due date assignment problems in scheduling a single machine
Operations Research Letters
2007-02-19Paper
Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function
Naval Research Logistics
2006-06-06Paper
Parallel machine scheduling with a convex resource consumption function
European Journal of Operational Research
2006-05-29Paper
A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates
Computers & Operations Research
2006-05-16Paper
Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
Computers & Operations Research
2004-11-12Paper
Minimizing the total weighted flow time in a single machine with controllable processing times
Computers & Operations Research
2004-11-12Paper
Convex resource allocation for minimizing the makespan in a single machine with job release dates
Computers & Operations Research
2004-10-14Paper
Optimization of the machining economics problem for a multistage transfer machine under failure, opportunistic and integrated replacement strategies
International Journal of Production Research
2004-07-12Paper
The efficiency range of economical cutting conditions and tool replacement under the age replacement strategy
International Journal of Production Research
2004-07-12Paper
Optimization of the machining economics problem under the periodic control strategy
International Journal of Production Research
2001-01-01Paper


Research outcomes over time


This page was built for person: Dvir Shabtay