| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Alexandre Dolgui, Valery S. Gordon, Vitaly A. Strusevich |
Single machine scheduling with precedence constraints and positionally dependent processing times.  |
Computers & OR  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Valery S. Gordon, Yury L. Orlovich, Chris N. Potts, Vitaly A. Strusevich |
Hamiltonian properties of locally connected graphs with bounded vertex degree. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Vitaly A. Strusevich |
Minimizing Total Weighted earliness-tardiness on a Single Machine around a Small Common due date: an FPTAS Using Quadratic Knapsack. |
Int. J. Found. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Vitaly A. Strusevich |
Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Irina N. Lushchakova, Vitaly A. Strusevich |
Scheduling incompatible tasks on two machines. |
European Journal of Operational Research |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Alan J. Soper, Vitaly A. Strusevich |
Transporting Jobs through a Processing Center with Two Parallel Machines. |
COCOA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Natalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich |
Single Machine Scheduling with Controllable Processing Times by submodular Optimization. |
Int. J. Found. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Valery S. Gordon, Vitaly A. Strusevich |
Single machine scheduling and due date assignment with positionally dependent processing times. |
European Journal of Operational Research |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Mikhail A. Kubzin, Vitaly A. Strusevich |
Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval. |
European Journal of Operational Research |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Christophe Rapine, Hans Kellerer, Chris N. Potts, Vitaly A. Strusevich |
Operator non-availability periods. |
4OR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerd Finke, Vitaly A. Strusevich, Frank Werner |
Guest Editorial. |
Computers & OR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikhail A. Kubzin, Chris N. Potts, Vitaly A. Strusevich |
Approximation results for flow shop scheduling problems with machine availability constraints. |
Computers & OR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris N. Potts, Vitaly A. Strusevich |
Fifty years of scheduling: a survey of milestones. |
JORS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Natalia V. Shakhlevich, Vitaly A. Strusevich |
Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Uniform parallel machine scheduling, Generalized polymatroid, Maximum flow, Controllable processing times |
| 1 | Valery S. Gordon, Chris N. Potts, Vitaly A. Strusevich, J. Douglass Whitehead |
Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation. |
J. Scheduling |
2008 |
DBLP DOI BibTeX RDF |
Deteriorating jobs, Learning effect, Priority-generating functions, Precedence constraints, Single machine scheduling |
| 1 | Natalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich |
Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach. |
ESA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yury L. Orlovich, Valery S. Gordon, Chris N. Potts, Vitaly A. Strusevich |
On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan J. Soper, Vitaly A. Strusevich |
An Improved Approximation Algorithm for the Two-Machine Flow Shop Scheduling Problem with an interstage transporter. |
Int. J. Found. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Oper. Res. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Vitaly A. Strusevich |
A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikhail A. Kubzin, Vitaly A. Strusevich |
Planning Machine Maintenance in Two-Machine Shop Scheduling. |
Operations Research |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Natalia V. Shakhlevich, Vitaly A. Strusevich |
Single machine scheduling with controllable release and processing parameters. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vitaly A. Strusevich |
Hans Kellerer, Ulrich Pferschy and David Pisinger, Knapsack Problems, Springer, Berlin (2004) ISBN 3-540-40286-1 546pp., EUR 99, 95. |
Oper. Res. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Louis Bouquard, Jean-Charles Billaut, Mikhail A. Kubzin, Vitaly A. Strusevich |
Two-machine flow shop scheduling problems with no-wait jobs. |
Oper. Res. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Carl Esswein, Jean-Charles Billaut, Vitaly A. Strusevich |
Two-machine shop scheduling: Compromise between flexibility and makespan value. |
European Journal of Operational Research |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikhail A. Kubzin, Vitaly A. Strusevich |
Two-machine flow shop no-wait scheduling with machine maintenance. |
4OR |
2005 |
DBLP DOI BibTeX RDF |
no-wait in process, controllable machine maintenance, approximation scheme, Flow shop scheduling |
| 1 | Natalia V. Shakhlevich, Vitaly A. Strusevich |
Pre-Emptive Scheduling Problems with Controllable Processing Times. |
J. Scheduling |
2005 |
DBLP DOI BibTeX RDF |
bicriteria problems, greedy algorithms, single machine scheduling, parallel machine scheduling, polymatroids, controllable processing times |
| 1 | Andrei A. Gladky, Yakov M. Shafransky, Vitaly A. Strusevich |
Flow Shop Scheduling Problems Under Machine-Dependent Precedence Constraints. |
J. Comb. Optim. |
2004 |
DBLP DOI BibTeX RDF |
complexity, polynomial-time algorithm, precedence constraints, flow shop |
| 1 | Mikhail Y. Kovalyov, Chris N. Potts, Vitaly A. Strusevich |
Batching decisions for assembly production systems. |
European Journal of Operational Research |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jatinder N. D. Gupta, Christos Koulamas, George J. Kyparisis, Chris N. Potts, Vitaly A. Strusevich |
Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan. |
Annals OR |
2004 |
DBLP DOI BibTeX RDF |
scheduling, approximation algorithm, makespan, polynomial time approximation scheme, flow shop |
| 1 | Hans Kellerer, Vitaly A. Strusevich |
Scheduling parallel dedicated machines under a single non-shared resource. |
European Journal of Operational Research |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Vitaly A. Strusevich |
Scheduling problems for parallel dedicated machines under multiple resource constraints. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard W. Eglese, Martin G. Everett, Chris N. Potts, Vitaly A. Strusevich |
Preface: International Symposium on Combinatorial Optimisation. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Breit, Günter Schmidt, Vitaly A. Strusevich |
Two-machine open shop scheduling with an availability constraint. |
Oper. Res. Lett. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Inna G. Drobouchevitch, Vitaly A. Strusevich |
Two-stage open shop scheduling with a bottleneck machine. |
European Journal of Operational Research |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Celia A. Glass, Chris N. Potts, Vitaly A. Strusevich |
Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops. |
INFORMS Journal on Computing |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Vitaly A. Strusevich |
Group technology approach to the open shop scheduling problem with batch setup times. |
Oper. Res. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Inna G. Drobouchevitch, Vitaly A. Strusevich |
Heuristics for the two-stage job shop scheduling problem with a bottleneck machine. |
European Journal of Operational Research |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
J. Heuristics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Valery S. Gordon, Vitaly A. Strusevich |
Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment. |
Computers & OR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Vitaly A. Strusevich |
A Heuristic for the Two-machine Open-shop Scheduling Problem with Transportation Times. |
Discrete Applied Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Bo Chen, Chris N. Potts, Vitaly A. Strusevich |
Approximation algorithms for two-machine flow shop scheduling with batch setup times. |
Math. Program. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Vitaly A. Strusevich, L. A. Hall |
An open shop scheduling problem with a non-bottleneck machine. |
Oper. Res. Lett. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jatinder N. D. Gupta, Vitaly A. Strusevich, C. M. Zwaneveld |
Two-stage no-wait scheduling models with setup and removal times separated. |
Computers & OR |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Vitaly A. Strusevich |
Two Machine Flow Shop Scheduling Problem with No Wait in Process: Controllable Machine Speeds. |
Discrete Applied Mathematics |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Vitaly A. Strusevich |
Two machine open shop scheduling problem with setup, processing and removal times separated. |
Computers & OR |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Bo Chen, Vitaly A. Strusevich |
Approximation Algorithms for Three-Machine Open Shop Scheduling. |
INFORMS Journal on Computing |
1993 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")