Shabtay Dvir

Dvir Shabtay

Information about the author Dvir Shabtay will soon be added to the site.
Found 28 papers in total
Proportionate flow-shop scheduling with rejection
Proportionate flow-shop scheduling with rejection
2016
In many heavily loaded manufacturing systems, managers routinely make use of...
A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system
A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system
2012
We analyze a two‐machine flow‐shop scheduling problem in which the job...
The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
2014
We study a scheduling problem with rejection on a single serial batching machine,...
A survey on offline scheduling with rejection
A survey on offline scheduling with rejection
2013
In classical deterministic scheduling problems, it is assumed that all jobs have to be...
An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
2012
In the majority of works on online scheduling on multipurpose machines the objective...
Maximizing the weighted number of just‐in‐time jobs in several two‐machine scheduling systems
Maximizing the weighted number of just‐in‐time jobs in several two‐machine scheduling systems
2012
The problem of maximizing the weighted number of just‐in‐time jobs in a...
Two‐machine flow‐shop scheduling with rejection
Two‐machine flow‐shop scheduling with rejection
2012
We study a scheduling problem with rejection on a set of two machines in a...
A bicriteria approach to scheduling a single machine with job rejection and positional penalties
A bicriteria approach to scheduling a single machine with job rejection and positional penalties
2012
Single machine scheduling problems have been extensively studied in the literature...
Online scheduling of two job types on a set of multipurpose machines with unit processing times
Online scheduling of two job types on a set of multipurpose machines with unit processing times
2012
We study a problem of scheduling a set of n jobs with unit processing times on a set...
The just‐in‐time scheduling problem in a flow‐shop scheduling system
The just‐in‐time scheduling problem in a flow‐shop scheduling system
2012
We study the problem of maximizing the weighted number of just‐in‐time (...
A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
2011
We study a single‐machine scheduling problem in a flexible framework where both...
Scheduling unit length jobs on parallel machines with lookahead information
Scheduling unit length jobs on parallel machines with lookahead information
2011
This paper studies two closely related online‐list scheduling problems of a set...
On the asymptotic behavior of subtour‐patching heuristics in solving the TSP on permuted Monge matrices
On the asymptotic behavior of subtour‐patching heuristics in solving the TSP on permuted Monge matrices
2011
We examine the performance of different subtour‐patching heuristics for solving...
Just-in-time scheduling with controllable processing times on parallel machines
Just-in-time scheduling with controllable processing times on parallel machines
2010
We study scheduling problems with controllable processing times on parallel machines....
Optimal due date assignment and resource allocation to minimize the weighted number of tardy jobs on a single machine
Optimal due date assignment and resource allocation to minimize the weighted number of tardy jobs on a single machine
2007
With the increased emphasis on the effective management of operational issues in...
The single-machine earliness–tardiness scheduling problem with due date assignment and resource-dependent processing times
The single-machine earliness–tardiness scheduling problem with due date assignment and resource-dependent processing times
2008
We study the earliness–tardiness scheduling problem on a single machine with due...
Parallel machine scheduling with a convex resource consumption function
Parallel machine scheduling with a convex resource consumption function
2006
We consider some problems of scheduling jobs on identical parallel machines where...
A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
2007
We extend the classical single-machine maximal lateness scheduling problem to the case...
Single machine batch scheduling to minimize total completion time and resource consumption costs
Single machine batch scheduling to minimize total completion time and resource consumption costs
2007
In this paper we study the single-machine batch scheduling problem under batch...
Minimizing the makespan in open-shop scheduling problems with a convex resource consumption function
Minimizing the makespan in open-shop scheduling problems with a convex resource consumption function
2006
We consider open-shop scheduling problems where operation-processing times are a...
Two due date assignment problems in scheduling a single machine
Two due date assignment problems in scheduling a single machine
2006
We study two single-machine scheduling problems: minimizing the sum of weighted...
A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates
A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates
2006
This paper presents a bicriterion analysis of time/cost trade-offs for the...
Convex resource allocation for minimizing the makespan in a single machine with job release dates
Convex resource allocation for minimizing the makespan in a single machine with job release dates
2004
We consider the problem of scheduling jobs on a single machine where job-processing...
Minimizing the total weighted flow time in a single machine with controllable processing times
Minimizing the total weighted flow time in a single machine with controllable processing times
2004
The scheduling problem of a single machine with the minimum total weighted flow time...
Papers per page: