Strusevich Vitaly A.

Vitaly A. Strusevich

Information about the author Vitaly A. Strusevich will soon be added to the site.
Found 16 papers in total
Pre-emptive scheduling problems with controllable processing times
Pre-emptive scheduling problems with controllable processing times
2005
We consider a range of single machine and identical parallel machine pre-emptive...
Three is easy, two is hard: open shop sum-batch scheduling problem refined
Three is easy, two is hard: open shop sum-batch scheduling problem refined
2006
For the two-machine open shop sum-batch problem to minimize the makespan an optimal...
Two-machine shop scheduling: Compromise between flexibility and makespan value
Two-machine shop scheduling: Compromise between flexibility and makespan value
2005
In this paper, we consider the problem of providing flexibility to solutions of...
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...
Two-machine flow shop no-wait scheduling with a nonavailability interval
Two-machine flow shop no-wait scheduling with a nonavailability interval
2004
We study a two-machine flow shop scheduling problem with no-wait in process, in which...
Group technology approach to the open shop scheduling problem with batch setup times
Group technology approach to the open shop scheduling problem with batch setup times
2000
This paper studies the problem of scheduling jobs in a two-machine open shop to...
Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
2004
This paper considers a variant of the classical problem of minimizing makespan in a...
A polynomial algorithm for the three-machine open shop with a bottleneck machine
A polynomial algorithm for the three-machine open shop with a bottleneck machine
1999
The paper considers the three-machine open shop scheduling problem to minimize the...
Two-stage open shop scheduling with a bottleneck machine
Two-stage open shop scheduling with a bottleneck machine
2001
It is known that for the open shop scheduling problem to minimize the makespan there...
Scheduling for parallel dedicated machines with a single server
Scheduling for parallel dedicated machines with a single server
2000
This paper examines scheduling problems in which the setup phase of each operation...
Approximation algorithms for two-machine flow shop scheduling with batch setup times
Approximation algorithms for two-machine flow shop scheduling with batch setup times
1998
In many practical situations, batching of similar jobs to avoid setups is performed...
Heuristics for short route job shop scheduling problems
Heuristics for short route job shop scheduling problems
1998
We consider two ‘minimum’ NP-hard job shop scheduling problems to minimize...
A heuristic algorithm for two-machine re-entrant shop scheduling
A heuristic algorithm for two-machine re-entrant shop scheduling
1999
This paper considers the problem of sequencing n jobs in a two-machine re-entrant shop...
Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
1995
The paper considers a two machine flow shop scheduling problem with no wait in...
Worst-case analysis of heuristics for open shops with parallel machines
Worst-case analysis of heuristics for open shops with parallel machines
1993
The paper considers the multi-stage open shop scheduling problem wit a numbe of...
Two machine open shop scheduling problem with setup, processing and removal times separated
Two machine open shop scheduling problem with setup, processing and removal times separated
1993
An algorithm for minimizing the makespan for the two machine open shop scheduling...
Papers per page: