Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Mikhail Y. Kovalyov
Information about the author Mikhail Y. Kovalyov will soon be added to the site.
Found
41 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Single supplier scheduling for multiple deliveries
2001
The problem of scheduling the production and delivery of a supplier to feed the...
Single machine batch scheduling with resource dependent setup and processing times
2001
Jobs are processed by a single machine in batches. A batch is a set of jobs processed...
Parallel machine batching and scheduling with deadlines
2000
In this paper, we study the problem of scheduling n independent jobs non-preemptively...
A fully polynomial approximation scheme for the weighted earliness–tardiness problem
1999
A fully polynomial approximation scheme for the problem of scheduling n jobs on a...
Scheduling with batching: A review
2000
There is an extensive literature on models that integrate scheduling with batching...
A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
1997
A fully polynomial approximation scheme for the problem of scheduling n deteriorating...
Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness
1999
We study the problem of scheduling n jobs on several parallel identical machines. An...
Scheduling a batching machine
1998
We address the problem of scheduling n jobs on a batching machine to minimize regular...
An exact algorithm for batching and scheduling two part types in a mixed shop: A technical note
1998
We consider the problem of scheduling jobs consisting of two part types in a shop made...
Batch scheduling with deadlines on parallel machines
1998
The problem of scheduling G groups of jobs on m parallel machines is considered. Each...
Single machine scheduling with batch deliveries
1996
The single machine batch scheduling problem is studied. The jobs in a batch are...
Single machine scheduling subject to deadlines and resource dependent processing times
1996
The problem of scheduling n jobs on a single machine is studied. Each job has a...
A polynomial approximation scheme for problem F 2/rj /Cmax
1997
We present a polynomial approximation scheme { H ϵ } for the strongly NP-hard...
Improving the complexities of approximation algorithms for optimization problems
1995
A procedure to improve the lower and upper bound for the optimal objective function...
Single machine group scheduling with two ordered criteria
1996
The problem of scheduling jobs on a single machine is considered. It is assumed that...
Single machine batch scheduling with deadlines and resource dependent processing times
1995
The authors consider the problem of scheduling n jobs on a single machine where each...
Single machine group scheduling with ordered criteria
1995
The single machine group scheduling problem is considered. Jobs are classified into...
First Page
1
2
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers