Kovalyov Mikhail Y.

Mikhail Y. Kovalyov

Information about the author Mikhail Y. Kovalyov will soon be added to the site.
Found 41 papers in total
Batch scheduling of step deteriorating jobs
Batch scheduling of step deteriorating jobs
2008
In this paper we consider the problem of scheduling n jobs on a single machine, where...
Problem F2‖Cmax with forbidden jobs in the first or last position is easy
Problem F2‖Cmax with forbidden jobs in the first or last position is easy
2007
Saadani et al. studied the classical n -job flow shop scheduling problem F2‖C...
Fixed interval scheduling: models, applications, computational complexity and algorithms
Fixed interval scheduling: models, applications, computational complexity and algorithms
2007
The defining characteristic of fixed interval scheduling problems is that each job has...
Scheduling in a contaminated area: A model and polynomial algorithms
Scheduling in a contaminated area: A model and polynomial algorithms
2006
There are n jobs to be scheduled in a contaminated area. The jobs can be rescue,...
Scheduling with controllable release dates and processing times: Makespan minimization
Scheduling with controllable release dates and processing times: Makespan minimization
2006
The paper deals with the single-machine scheduling problem in which job processing...
Scheduling with controllable release dates and processing times: Total completion time minimization
Scheduling with controllable release dates and processing times: Total completion time minimization
2006
The single machine scheduling problem with two types of controllable parameters, job...
Batching and scheduling in a multi-machine flow shop
Batching and scheduling in a multi-machine flow shop
2007
We study the problem of batching and scheduling n jobs in a flow shop comprising m , m...
Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity
Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity
2007
We study a deterministic problem of evaluating the worst case performance of flexible...
Cost minimizing scheduling of work and rework processes on a single facility under deterioration of reworkables
Cost minimizing scheduling of work and rework processes on a single facility under deterioration of reworkables
2007
The problem of scheduling the production of new and recovering defective items of the...
Batching work and rework processes with limited deterioration of reworkables
Batching work and rework processes with limited deterioration of reworkables
2006
We study a deterministic problem of planning the production of new and recovering...
Optimal testing and repairing a failed series system
Optimal testing and repairing a failed series system
2006
We consider a series repairable system that includes n components and assume that it...
Positive half-products and scheduling with controllable processing times
Positive half-products and scheduling with controllable processing times
2005
We study the single machine scheduling problem with controllable job processing times...
Single machine group scheduling with resource dependent setup and processing times
Single machine group scheduling with resource dependent setup and processing times
2005
A single machine scheduling problem is studied. There is a partition of the set of n...
Batching decisions for assembly production systems
Batching decisions for assembly production systems
2004
The two-stage assembly scheduling problem is a model for production processes that...
A fully polynomial time approximation scheme for scheduling a two-machine flowshop with one unavailability interval
A fully polynomial time approximation scheme for scheduling a two-machine flowshop with one unavailability interval
2004
We study a deterministic two-machine flowshop scheduling problem with an assumption...
Single machine batch scheduling with jointly compressible setup and processing times
Single machine batch scheduling with jointly compressible setup and processing times
2004
A single machine batch scheduling problem is addressed. A batch is a set of jobs...
Maximization problems in single machine scheduling
Maximization problems in single machine scheduling
2004
Problems of scheduling n jobs on a single machine to maximize regular objective...
Scheduling malleable tasks on parallel processors to minimize the makespan
Scheduling malleable tasks on parallel processors to minimize the makespan
2004
The problem of optimal scheduling n tasks in a parallel processor system is studied....
Single machine scheduling with a variable common due date and resource-dependent processing times
Single machine scheduling with a variable common due date and resource-dependent processing times
2003
The problem of scheduling n jobs with a variable common due date on a single machine...
Approximation schemes for scheduling jobs with common due date on parallel machines to minimize total tardiness
Approximation schemes for scheduling jobs with common due date on parallel machines to minimize total tardiness
2002
The problem of scheduling n nonpreemptive jobs having a common due date d on m , m...
The complexity of two group scheduling problems
The complexity of two group scheduling problems
2002
The problems of scheduling groups of jobs under the group technology assumption are...
Scheduling jobs with piecewise linear decreasing processing times
Scheduling jobs with piecewise linear decreasing processing times
2003
We study the problems of scheduling a set of nonpreemptive jobs on a single or...
An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: A technical note
An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: A technical note
2002
The problem of unconstrained minimization of a piecewise linear function of one...
Fast fully polynomial approximation schemes for minimizing completion time variance
Fast fully polynomial approximation schemes for minimizing completion time variance
2002
We present fully polynomial approximation schemes for the problem of minimizing...
Papers per page: