Strusevich V.A.

V.A. Strusevich

Information about the author V.A. Strusevich will soon be added to the site.
Found 26 papers in total
Planning machine maintenance in two-machine shop scheduling
2006
We consider the two-machine open shop and two-machine flow shop scheduling problems in...
Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints
2006
This paper addresses a two-machine open shop scheduling problem, in which the machines...
Two-machine flow shop scheduling problems with no-wait jobs
2005
In this paper we provide a fairly complete complexity classification of various...
Scheduling parallel dedicated machines under a single non-shared resource
2003
The scheduling problem of minimizing the makespan for m parallel dedicated machines...
Non-preemptive two-machine open shop scheduling with non-availability constraints
2003
We study a two-machine open shop scheduling problem, in which the machines are not...
Scheduling batches with sequential job processing for two-machine flow and open shops
2001
In this paper, we study a problem of scheduling and batching on two machines in a...
Three-machine shop scheduling with partially ordered processing routes
2002
This paper considers the problem of sequencing n jobs in a three-machine shop with the...
Scheduling batches with sequential job processing for two-machine flow and open shops
2001
In this paper, we study a problem of scheduling and batching on two machines in a...
Scheduling batches with simultaneous job processing for two-machine shop problems
2001
We consider the problem of scheduling independent jobs on two machines in an open...
Heuristics for the two-stage job shop scheduling problem with a bottleneck machine
2000
The paper considers the job shop scheduling problem to minimize the makespan. It is...
A new heuristic for three-machine flow shop scheduling
1996
This paper considers the problem of sequencing n jobs in a three-machine flow shop...
A 3/2 algorithm for two-machine open shop with route-dependent processing times
1999
This paper considers the problem of minimizing the schedule length of a two-machine...
Two-machine open shop scheduling with special transportation times
1999
The paper considers a problem of scheduling n jobs in a two-machine open shop to...
A heuristic for the two-machine open-shop scheduling problem with transportation times
1999
The paper considers a problem of scheduling n jobs in a two-machine open shop to...
Earliness penalties on a single machine subject to precedence constraints: Common slack allowance due date assignment
1999
The paper considers the single machine due date assignment and scheduling problems...
An open shop scheduling problem with a non-bottleneck machine
1997
This paper considers the problem of processing n jobs in a two-machine non-preemptive...
A greedy open shop heuristic with job priorities
1998
The paper presents an improved version of the greedy open shop approximation algorithm...
The open shop scheduling problem with a given sequence of jobs on one machine
1998
The paper considers the open shop scheduling problem to minimize the makespan,...
The two-stage assembly scheduling problem: Complexity and approximation
1995
This paper introduces a new two-stage assembly scheduling problem. There are m...
Two-stage no-wait scheduling models with setup and removal times separated
1997
This paper studies two models of two-stage processing with no-wait in process. The...
The two-stage assembly scheduling problem: Complexity and approximation
1995
This paper introduces a new two-stage assembly scheduling problem. There are m...
Shop scheduling problems under precedence constraints
1997
This paper considers a scheduling model that generalizes the well-known open shop,...
Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function
1993
The paper presents a linear-time algorithm for solving the two machine open shop...
On non-permutation solutions to some two machine flow shop scheduling problems
1994
In this paper, the authors study two versions of the two machine flow shop scheduling...
Papers per page: