The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Vitaly A. Strusevich: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mikhail A. Kubzin, Vitaly A. Strusevich
    Two-machine flow shop no-wait scheduling with machine maintenance. [Citation Graph (0, 0)][DBLP]
    4OR, 2005, v:3, n:4, pp:303-313 [Journal]
  2. Valery S. Gordon, Vitaly A. Strusevich
    Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1999, v:26, n:2, pp:157-177 [Journal]
  3. J. N. D. Gupta, Vitaly A. Strusevich, C. M. Zwaneveld
    Two-stage no-wait scheduling models with setup and removal times separated. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1997, v:24, n:11, pp:1025-1031 [Journal]
  4. Vitaly A. Strusevich
    Two machine open shop scheduling problem with setup, processing and removal times separated. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1993, v:20, n:6, pp:597-611 [Journal]
  5. Richard W. Eglese, Martin G. Everett, Chris N. Potts, Vitaly A. Strusevich
    Preface: International Symposium on Combinatorial Optimisation. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:133, n:1-3, pp:1-2 [Journal]
  6. Hans Kellerer, Vitaly A. Strusevich
    Scheduling problems for parallel dedicated machines under multiple resource constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:133, n:1-3, pp:45-68 [Journal]
  7. Vitaly A. Strusevich
    Two Machine Flow Shop Scheduling Problem with No Wait in Process: Controllable Machine Speeds. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:59, n:1, pp:75-86 [Journal]
  8. Vitaly A. Strusevich
    A Heuristic for the Two-machine Open-shop Scheduling Problem with Transportation Times. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:93, n:2-3, pp:287-304 [Journal]
  9. Natalia V. Shakhlevich, Vitaly A. Strusevich
    Single machine scheduling with controllable release and processing parameters. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:15, pp:2178-2199 [Journal]
  10. Vitaly A. Strusevich, A. J. A. van de Waart, R. Dekker
    A 3/2 Algorithm for Two-Machine Open Shop with Route-Dependent Processing Times. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 1999, v:5, n:1, pp:5-28 [Journal]
  11. Celia A. Glass, Chris N. Potts, Vitaly A. Strusevich
    Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2001, v:13, n:2, pp:120-137 [Journal]
  12. Andrei A. Gladky, Yakov M. Shafransky, Vitaly A. Strusevich
    Flow Shop Scheduling Problems Under Machine-Dependent Precedence Constraints. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2004, v:8, n:1, pp:13-28 [Journal]
  13. Bo Chen, Chris N. Potts, Vitaly A. Strusevich
    Approximation algorithms for two-machine flow shop scheduling with batch setup times. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:255-271 [Journal]
  14. Jean-Louis Bouquard, Jean-Charles Billaut, Mikhail A. Kubzin, Vitaly A. Strusevich
    Two-machine flow shop scheduling problems with no-wait jobs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:3, pp:255-262 [Journal]
  15. Joachim Breit, Günter Schmidt, Vitaly A. Strusevich
    Two-machine open shop scheduling with an availability constraint. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:29, n:2, pp:65-77 [Journal]
  16. Irina V. Gribkovskaia, Chung-Yee Lee, Vitaly A. Strusevich, Dominique de Werra
    Three is easy, two is hard: open shop sum-batch scheduling problem refined. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:4, pp:459-464 [Journal]
  17. Vitaly A. Strusevich
    Group technology approach to the open shop scheduling problem with batch setup times. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:26, n:4, pp:181-192 [Journal]
  18. Vitaly A. Strusevich
    Hans Kellerer, Ulrich Pferschy and David Pisinger, Knapsack Problems, Springer, Berlin (2004) ISBN 3-540-40286-1 546pp., EUR 99, 95. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:2, pp:217-219 [Journal]
  19. Vitaly A. Strusevich, L. A. Hall
    An open shop scheduling problem with a non-bottleneck machine. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1997, v:21, n:1, pp:11-18 [Journal]
  20. Natalia V. Shakhlevich, Vitaly A. Strusevich
    Pre-Emptive Scheduling Problems with Controllable Processing Times. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2005, v:8, n:3, pp:233-253 [Journal]
  21. Hans Kellerer, Vitaly A. Strusevich
    A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:230-238 [Journal]
  22. Carl Esswein, Jean-Charles Billaut, Vitaly A. Strusevich
    Two-machine shop scheduling: Compromise between flexibility and makespan value. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:167, n:3, pp:796-809 [Journal]
  23. Mikhail Y. Kovalyov, Chris N. Potts, Vitaly A. Strusevich
    Batching decisions for assembly production systems. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2004, v:157, n:3, pp:620-642 [Journal]
  24. Hans Kellerer, Vitaly A. Strusevich
    Scheduling parallel dedicated machines under a single non-shared resource. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:147, n:2, pp:345-364 [Journal]

  25. Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach. [Citation Graph (, )][DBLP]


  26. Operator non-availability periods. [Citation Graph (, )][DBLP]


  27. Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times. [Citation Graph (, )][DBLP]


  28. Guest Editorial. [Citation Graph (, )][DBLP]


  29. Approximation results for flow shop scheduling problems with machine availability constraints. [Citation Graph (, )][DBLP]


Search in 0.016secs, Finished in 0.019secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002