Skip navigation

Items where Greenwich Author is "Strusevich, Vitaly"

Items where Greenwich Author is "Strusevich, Vitaly"

Up a level
Export as [feed] RSS
Group by: Item Type | Date | Funders | Uncontrolled Keywords | No Grouping
Jump to: Combinatorial optimization; Container terminals; Import containers; Branch-and-bound | Combinatorial optimization; Non-linear boolean programming; Geometric rounding; K -approximation sets and functions, FPTAS | Hamiltonian graph, local connectivity, NP-completeness | Helicopter transportation; Takeoff and landing risk; Machine scheduling; Bin-packing; Worst-case analysis; Heuristics | Management Science and Operations Research, Software, Information Systems, Computer Science Applications | Scheduling with controllable processing times, Scheduling with imprecise computation, Flows in networks, Optimization with submodular constraints | Scheduling, Uniform parallel machines, Power of preemption | Scheduling, single machine, positional effect, cumulative effect, total completion time, V-shaped V-shaped | Scheduling, uniform parallel machines, power of preemption, quality of a single preemption | Scheduling; Uniform parallel machines; Power of preemption | Scheduling; Changing processing times; Rate-modifying activities | Scheduling; Maintenance; Deterioration; Learning; Rate modifying activity | Scheduling; Precedence constraints; Deterioration; Learning; Positionally dependent processing time. | Scheduling; Total completion time; Power of pre-emption; Uniformly related machines | Single machine scheduling; Earliness-Tardiness; Half-product problem; FPTAS | Single machine; Deterioration; Precedence constraints; Maintenance; Approximation scheme; Half-product problem | Submodular optimization, Parallel machine scheduling, Controllable processing times, Decomposition | V S Tanaev, optimization problems | approximation, open shop scheduling, heuristics, worst-case analysis | assembly scheduling problem, flow shop, batching, batch availability, complexity, approximation | combinatorial optimisation | convex sequence, V-shaped sequence, ceiling function | deterioration, learning, positionally dependent processing time, precedence constraints, scheduling | due date assignment, scheduling problems, optimal sequencing, technological, marketing, precedence constraints, classical deterministic scheduling models | flow shop scheduling, machine non-availability, approximation algorithm | flow shop scheduling, no-wait in process, nonavailability interval, worst-case analysis | flow shop scheduling, scheduling with transportation, approximation algorithm, linear relaxation | flow shop scheduling, scheduling with transportation, approximation algorithm, linear relaxation, | flow shop, no-wait, complexity, approximation | flow shop, precedence constraints, complexity, polynomial-time algorithm | ingle machine scheduling, controllable processing times, controllable processing speeds, controllable release dates, controllable release speeds | job shop scheduling, approximation algorithm, worst-case analysis | machine scheduling; uniform parallel machines; power of preemption; | manufacturing plant control, automation, IT | one-machine scheduling, operator non-availability, complexity, list algorithms, performance analysis | open shop scheduling, approximation algorithm, worst-case analysis | open shop scheduling, availability constraints, worst-case analysis | open shop scheduling, lower bound, polynomial algorithm | open shop scheduling, transportation time, two machines | open shop, batching, group technology, approximation | open shop, complexity, dynamic programming, fully polynomial approximation scheme, worst-case analysis, approximation | open shop, machine availability, approximation scheme | open shop, transportation time, approximation, worst-case analysis | open shop,complexity, approximation | parallel dedicated machines, non-shared resources, complexity, approximation, worst-case analysis | parallel identical machines; resource constraints; group technology; approximation | polymatroid optimization, divide-and-conquer algorithm, scheduling | production, scheduling, multiple machine, maintenance, replacement | production-scheduling, open-shop, flow-shop, analysis of algorithms, computational complexity, suboptimal algorithms | production/scheduling, approximations/heuristic, production/scheduling, sequencing, deterministic, multiple machine | production/scheduling, flow shop, approximations/heuristic, worst-case analysis | programming: linear; production scheduling: deterministic, single machine; analysis of algorithms: computational complexity | quadratic boolean programming, approximation, scheduling | quadratic knapsack, half-product, singlemachine scheduling, FPTAS | quadratic knapsack, single machine scheduling, earliness-tardiness, FPTAS | quadratic knapsack, single machine scheduling, total weighted completion time, availability constraints, scheduling agents, FPTAS | re-entrant shop scheduling, approximation algorithm, worst-case analysis, | scheduling algorithms, batch,on-line, analytic approximations | scheduling with transportation, open shop, approximation algorithm, | scheduling with transportation, parallel machines, FPTAS, | scheduling with transportation, parallel machines, approximation scheme, | scheduling, Half-Product, quadratic knapsack, scheduling with rejection, scheduling with controllable processing times, FPTAS | scheduling, Vyacheslav S. Tanaev, mathematical analyses | scheduling, batching, polynomial algorithm, NP-hard, open shop, job shop, flow shop | scheduling, computer modelling | scheduling, due date assignment, precedence constraints, deterioration, learning, maintenance activity | scheduling, flexibility, robustness, flow shop, job shop, open shop | scheduling, flow shop, batch setup times, approximation algorithm, performance analysis | scheduling, flow shop, makespan, approximation algorithm, polynomial time approximation scheme | scheduling, history, milestones | scheduling, maintenance, sequencing, deterioration, single machine, assignment problem | scheduling, open shop, batching, group technology, approximation | scheduling, open shop, batching, polynomial-time algorithm | scheduling, parallel dedicated machines, resource constraints, complexity, approximation | scheduling, parallel dedicated machines, single server, complexity, approximation | scheduling, sequencing, permutation, priority-generating function, symmetric function, mixed graph, parametric decomposition, Minsk Group, Vyacheslav Tanaev | scheduling, single machine, parallel machines, controllable processing times | scheduling, single machine, parallel machines, positional effects, job deterioration, assignment problem | shop scheduling, approximation algorithm, worst-case analysis | shop scheduling, makespan minimization, partially ordered route, approximation | shop scheduling, precedence constraints, computational complexity | single machine scheduling | single machine scheduling, common due date assignment, SLK due date assignment, positionally dependent processing times | single machine scheduling, deteriorating jobs, learning effect, precedence constraints, priority-generating functions | single machine scheduling, due date assignment | single machine scheduling, due date assignment, precedence constraints, earliness penalties | single machine scheduling, machine non-availability, total weighted completion time, approximation algorithm | single machine scheduling, parallel machine scheduling, controllable processing times, bicriteria problems, polymatroids, greedy algorithms | single machine scheduling, time-dependent linear deterioration, rate-modifying maintenance, sequencing, maintenance, deterioration, time-dependent effects, assignment problem | single machine scheduling, weighted total tardiness, dynamic programming, FPTAS | single machine scheduling; controllable processing times; polymatroid; base polyhedron | single machine, deterioration, maintenance, approximation scheme, subset-sum problem, Half-Product Problem | submodular optimization, parallel machine scheduling, controllable processing times, bicriteria problems | two machine scheduling, incompatibility graph, max-batch, polynomial algorithm | two-stage no-wait scheduling models, setup time, removal time | uniform parallel machine scheduling, controllable processing times, generalized polymatroid, maximum flow | unrelated parallel machines; power of preemption; quality of a single preemption
Number of items: 102.

Combinatorial optimization; Container terminals; Import containers; Branch-and-bound

Silva, Marcos de Melo da, Erdoğan, Güneş, Battarra, Maria and Strusevich, Vitaly (2017) The block retrieval problem. European Journal of Operational Research, 265 (3). pp. 931-950. ISSN 0377-2217 (doi:https://doi.org/10.1016/j.ejor.2017.08.048)

Combinatorial optimization; Non-linear boolean programming; Geometric rounding; K -approximation sets and functions, FPTAS

Halman, Nir, Kellerer, Hans and Strusevich, Vitaly A. (2018) Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints. European Journal of Operational Research, 270 (2). pp. 435-447. ISSN 0377-2217 (doi:https://doi.org/10.1016/j.ejor.2018.04.013)

Hamiltonian graph, local connectivity, NP-completeness

Gordon, Valery S., Orlovich, Yury L., Potts, Chris N. and Strusevich, Vitaly A. (2010) Hamiltonian properties of locally connected graphs with bounded vertex degree. Discrete Applied Mathematics, 159 (16). pp. 1759-1774. ISSN 0166-218X (doi:https://doi.org/10.1016/j.dam.2010.10.005)

Orlovich, Yury L., Gordon, Valery S., Potts, Chris N. and Strusevich, Vitaly A. (2007) On Hamilton cycles in locally connected graphs with vertex degree constraints. Electronic Notes in Discrete Mathematics, 29. pp. 169-173. ISSN 1571-0653 (doi:https://doi.org/10.1016/j.endm.2007.07.028)

Helicopter transportation; Takeoff and landing risk; Machine scheduling; Bin-packing; Worst-case analysis; Heuristics

Qian, Fubin, Strusevich, Vitaly, Gribkovskaia, Irina and Halskau, Øyvind (2014) Minimization of passenger takeoff and landing risk in offshore helicopter transportation: models, approaches and analysis. Omega, 51. pp. 93-106. ISSN 0305-0483 (doi:https://doi.org/10.1016/j.omega.2014.09.002)

Management Science and Operations Research, Software, Information Systems, Computer Science Applications

Shioura, Akiyoshi, Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2017) Machine speed scaling by adapting methods for convex optimization with submodular constraints. INFORMS Journal on Computing, 29 (4). pp. 724-736. ISSN 1091-9856 (Print), 1526-5528 (Online) (doi:https://doi.org/10.1287/ijoc.2017.0758)

Scheduling with controllable processing times, Scheduling with imprecise computation, Flows in networks, Optimization with submodular constraints

Shioura, Akiyoshi, Shakhlevich, Natalia V. and Strusevich, Vitaly (2017) Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches. European Journal of Operational Research, 266 (3). pp. 795-818. ISSN 0377-2217 (doi:https://doi.org/10.1016/j.ejor.2017.08.034)

Scheduling, Uniform parallel machines, Power of preemption

Soper, Alan J. ORCID: 0000-0002-0901-9803 and Strusevich, Vitaly A. (2018) Parametric analysis of the quality of single preemption schedules on three uniform parallel machines. Annals of Operations Research, 298 (1-2). pp. 469-495. ISSN 0254-5330 (Print), 1572-9338 (Online) (doi:https://doi.org/10.1007/s10479-018-2952-6)

Scheduling, single machine, positional effect, cumulative effect, total completion time, V-shaped V-shaped

Soper, Alan J. ORCID: 0000-0002-0901-9803 and Strusevich, Vitaly (2019) Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects. Journal of Scheduling, 23 (6). pp. 665-680. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1007/s10951-019-00628-4)

Scheduling, uniform parallel machines, power of preemption, quality of a single preemption

Soper, Alan J. ORCID: 0000-0002-0901-9803 and Strusevich, Vitaly A. (2018) Schedules with a single preemption on uniform parallel machines. Discrete Applied Mathematics. ISSN 0166-218X (doi:https://doi.org/10.1016/j.dam.2018.03.007)

Scheduling; Uniform parallel machines; Power of preemption

Soper, Alan J. ORCID: 0000-0002-0901-9803 and Strusevich, Vitaly A. (2014) Single parameter analysis of power of preemption on two and three uniform machines. Discrete Optimization, 12. pp. 26-46. ISSN 1572-5286 (doi:https://doi.org/10.1016/j.disopt.2013.12.004)

Scheduling; Changing processing times; Rate-modifying activities

Strusevich, Vitaly and Rustogi, Kabir (2016) Scheduling with Time-Changing Effects and Rate-Modifying Activities. International Series in Operations Research & Management Science, 243 . Springer, Switzerland. ISBN 978-3319395722

Scheduling; Maintenance; Deterioration; Learning; Rate modifying activity

Rustogi, Kabir and Strusevich, Vitaly A. (2014) Combining time and position dependent effects on a single machine subject to rate-modifying activities. Omega, 42 (1). pp. 166-178. ISSN 0305-0483 (doi:https://doi.org/10.1016/j.omega.2013.05.005)

Scheduling; Precedence constraints; Deterioration; Learning; Positionally dependent processing time.

Dolgui, Alexandre, Gordon, Valery and Strusevich, Vitaly (2010) Single machine scheduling with precedence constraints and positionally dependent processing times. Computers & Operations Research, 39 (6). pp. 1218-1224. ISSN 0305-0548 (doi:https://doi.org/10.1016/j.cor.2010.06.004)

Scheduling; Total completion time; Power of pre-emption; Uniformly related machines

Epstein, Leah, Levin, Asif, Soper, Alan ORCID: 0000-0002-0901-9803 and Strusevich, Vitaly (2017) Power of preemption for minimizing total completion time for uniform parallel machines. SIAM Journal on Discrete Mathematics, 31 (1). pp. 101-123. ISSN 0895-4801 (Print), 1095-7146 (Online) (doi:https://doi.org/10.1137/16M1066610)

Single machine scheduling; Earliness-Tardiness; Half-product problem; FPTAS

Kellerer, Hans, Rustogi, Kabir and Strusevich, Vitaly A. (2018) A fast FPTAS for single machine scheduling problem of minimizing total weighted earliness and tardiness about a large common due date. Omega, 90:101992. ISSN 0305-0483 (doi:https://doi.org/10.1016/j.omega.2018.11.001)

Single machine; Deterioration; Precedence constraints; Maintenance; Approximation scheme; Half-product problem

Rustogi, Kabir and Strusevich, Vitaly A. (2016) Single machine scheduling with a generalized job-dependent cumulative effect. Journal of Scheduling, 20 (6). pp. 583-592. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1007/s10951-016-0497-6)

Submodular optimization, Parallel machine scheduling, Controllable processing times, Decomposition

Shioura, Akiyoshi, Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2015) Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times. Mathematical Programming, 153 (2). pp. 495-534. ISSN 0025-5610 (Print), 1436-4646 (Online) (doi:https://doi.org/10.1007/s10107-014-0814-9)

V S Tanaev, optimization problems

Gordon, V.S., Kovalyov, M. Ya, Levin, G.M., Sotskov, Yu N., Strusevich, V.A., Tuzikov, A.V. and Shafransky, Ya M. (2010) Creative heritage of Vyacheslav Sergeevich Tanaev: Seventieth anniversary. Automation and Remote Control, 71 (10). pp. 2021-2028. ISSN 0005-1179 (Print), 1608-3032 (Online) (doi:https://doi.org/10.1134/S0005117910100024)

approximation, open shop scheduling, heuristics, worst-case analysis

Strusevich, V.A., van de Waart, A.J.A. and Dekker, R. (1999) A 3/2 algorithm for two-machine open shop with route-dependent processing times. Journal of Heuristics, 5 (1). pp. 5-28. ISSN 1381-1231 (Print), 1572-9397 (Online) (doi:https://doi.org/10.1023/A:1009643112214)

assembly scheduling problem, flow shop, batching, batch availability, complexity, approximation

Kovalyov, M.Y., Potts, C.N. and Strusevich, V.A. (2003) Batching decisions for assembly production systems. European Journal of Operational Research, 157 (3). pp. 620-642. ISSN 0377-2217 (doi:https://doi.org/10.1016/S0377-2217(03)00250-9)

combinatorial optimisation

Eglese, Richard W., Everett, Martin G., Potts, Chris N. and Strusevich, Vitaly A. (2003) Preface [Special Issue: International Symposium on Combinatorial Optimisation (CO2000)]. Discrete Applied Mathematics, 133 (1-3). pp. 1-2. ISSN 0166-218X (doi:https://doi.org/10.1016/S0166-218X(03)00430-X)

convex sequence, V-shaped sequence, ceiling function

Rustogi, Kabir and Strusevich, Vitaly A. (2011) Convex and V-shaped sequences of sums of functions that depend on ceiling functions. Journal of Integer Sequences, 14 (1). pp. 1-9. ISSN 1530-7638

deterioration, learning, positionally dependent processing time, precedence constraints, scheduling

Dolgui, Alexandre, Gordon, Valery and Strusevich, Vitaly (2012) Single machine scheduling with precedence constraints and positionally dependent processing times. Computers and Operations Research, 39 (6). pp. 1218-1224. ISSN 0305-0548 (doi:https://doi.org/10.1016/j.cor.2010.06.004)

due date assignment, scheduling problems, optimal sequencing, technological, marketing, precedence constraints, classical deterministic scheduling models

Gordon, Valery, Dolgui, Alexandre and Strusevich, Vitaly (2009) Due date assignment and scheduling under special conditions on job processing. In: Information Control Problems in Manufacturing. International Federation of Automatic Control (IFAC) / Elsevier. ISBN 978-3-902661-43-2 ISSN 1474-6670 (doi:https://doi.org/10.3182/20090603-3-RU-2001.00086)

flow shop scheduling, machine non-availability, approximation algorithm

Kubzin, Mikhail A., Potts, Chris N. and Strusevich, Vitaly A. (2009) Approximation results for flow shop scheduling problems with machine availability constraints. Computers & Operations Research, 36 (2). pp. 379-390. ISSN 0305-0548 (doi:https://doi.org/10.1016/j.cor.2007.10.013)

flow shop scheduling, no-wait in process, nonavailability interval, worst-case analysis

Kubzin, Mikhail A. and Strusevich, Vitaly A. (2004) Two-machine flowshop scheduling problems with no-wait jobs. Naval Research Logistics, 51 (4). pp. 613-631. ISSN 0894-069X (Print), 1520-6750 (Online) (doi:https://doi.org/10.1002/nav.10118)

flow shop scheduling, scheduling with transportation, approximation algorithm, linear relaxation

Soper, Alan ORCID: 0000-0002-0901-9803 and Strusevich, Vitaly A. (2007) An improved approximation algorithm for the two-machine flow shop scheduling problem with an interstage transporter. International Journal of Foundations of Computer Science, 18 (3). pp. 565-591. ISSN 0129-0541 (doi:https://doi.org/10.1142/S012905410700484X)

flow shop scheduling, scheduling with transportation, approximation algorithm, linear relaxation,

Soper, Alan ORCID: 0000-0002-0901-9803 and Strusevich, Vitaly A. (2007) An approximation algorithm for the two-machine flow shop with a single transporter. International Journal of Foundations of Computer Science (ijfcs), 18 (3). pp. 565-591. ISSN 0129-0541 (doi:https://doi.org/10.1142/S012905410700484X)

flow shop, no-wait, complexity, approximation

Bouquard, J-L, Billaut, J.-C., Kubzin, M.A. and Strusevich, V.A. (2005) Two-machine flow shop scheduling problems with no-wait jobs. Operations Research Letters, 33 (3). pp. 255-262. ISSN 0167-6377 (doi:https://doi.org/10.1016/j.orl.2004.06.003)

flow shop, precedence constraints, complexity, polynomial-time algorithm

Gladky, A.A., Shafransky, Y.M. and Strusevich, V.A. (2004) Flow shop scheduling problems under machine–dependent precedence constraints. Journal of Combinatorial Optimization, 8 (1). pp. 13-28. ISSN 1382-6905 (Print), 1573-2886 (Online) (doi:https://doi.org/10.1023/B:JOCO.0000021935.66577.09)

ingle machine scheduling, controllable processing times, controllable processing speeds, controllable release dates, controllable release speeds

Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2006) Single machine scheduling with controllable release and processing parameters. Discrete Applied Mathematics, 154 (15). pp. 2178-2199. ISSN 0166-218X (doi:https://doi.org/10.1016/j.dam.2005.04.014)

job shop scheduling, approximation algorithm, worst-case analysis

Drobouchevitch, I.G. and Strusevich, V.A. (2000) Heuristics for the two-stage job shop scheduling problem with a bottleneck machine. European Journal of Operational Research, 123 (2). pp. 229-240. ISSN 0377-2217 (doi:https://doi.org/10.1016/S0377-2217(99)00253-2)

Drobouchevitch, Inna G. and Strusevich, Vitaly A. (1998) Heuristics for short route job shop scheduling problems. Mathematical Methods of Operations Research, 48 (3). pp. 359-375. ISSN 1432-2994 (Print), 1432-5217 (Online) (doi:https://doi.org/10.1007/s001860050033)

machine scheduling; uniform parallel machines; power of preemption;

Soper, Alan J. ORCID: 0000-0002-0901-9803 and Strusevich, Vitaly A. (2014) Power of preemption on uniform parallel machines. In: 17th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX’14) / 18th International Workshop on Randomization and Computation (RANDOM’14). Leibniz International Proceedings in Informatics (LIPIcs) (28). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, pp. 392-402. ISBN 9783939897743 ISSN 1868-8969 (doi:https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.392)

manufacturing plant control, automation, IT

Soper, Alan ORCID: 0000-0002-0901-9803 and Strusevich, Vitaly A. (2006) Two-machine flow shop scheduling with an interstage transporter: two shipments. In: Dolgui, Alexandre, Morel, Gerard and Pereira, Carlos Eduardo, (eds.) Information Control Problems in Manufacturing 2006: A Proceedings volume from the 12th IFAC International Symposium, St Etienne, France, 17-19 May 2006. IFAC Proceedings Volumes, 3 . Elsevier Ltd., Oxford, UK, pp. 27-32. ISBN 978-0-08-044654-7

one-machine scheduling, operator non-availability, complexity, list algorithms, performance analysis

Brauner, N., Finke, G., Lehoux-Lebacque, V., Rapine, C., Kellerer, H., Potts, C. and Strusevich, V. (2009) Operator non-availability periods. 4OR: A Quarterly Journal of Operations Research, 7 (3). pp. 239-253. ISSN 1619-4500 (Print), 1614-2411 (Online) (doi:https://doi.org/10.1007/s10288-008-0084-6)

open shop scheduling, approximation algorithm, worst-case analysis

Drobouchevitch, Inna G. and Strusevich, Vitaly A. (2001) Two-stage open shop scheduling with a bottleneck machine. European Journal of Operational Research, 128 (1). pp. 159-174. ISSN 0377-2217 (doi:https://doi.org/10.1016/S0377-2217(99)00356-2)

Strusevich, V.A. (1998) A greedy open shop heuristic with job priorities. Annals of Operations Research, 83. pp. 253-270. ISSN 0254-5330 (Print), 1572-9338 (Online) (doi:https://doi.org/10.1023/A:1018964131329)

open shop scheduling, availability constraints, worst-case analysis

Breit, J., Schmidt, G. and Strusevich, V.A. (2003) Non-preemptive two-machine open shop scheduling with non-availability constraints. Mathematical Methods of Operations Research, 57 (2). pp. 217-234. ISSN 1432-2994 (Print), 1432-5217 (Online) (doi:https://doi.org/10.1007/s001860200267)

Breit, Joachim, Schmidt, Günter and Strusevich, Vitaly A. (2001) Two-machine open shop scheduling with an availability constraint. Operations Research Letters, 29 (2). pp. 65-77. ISSN 0167-6377 (doi:https://doi.org/10.1016/S0167-6377(01)00079-7)

open shop scheduling, lower bound, polynomial algorithm

Drobouchevitch, Inna G. and Strusevich, Vitaly A. (1999) A polynomial algorithm for the three-machine open shop with a bottleneck machine. Annals of Operations Research, 92. pp. 185-210. ISSN 0254-5330 (Print), 1572-9338 (Online) (doi:https://doi.org/10.1023/A:1018982630730)

open shop scheduling, transportation time, two machines

Rebaine, D. and Strusevich, V.A. (1999) Two-machine open shop scheduling with special transportation times. Journal of the Operational Research Society, 50. pp. 756-764. ISSN 0160-5682 (doi:https://doi.org/10.1057/palgrave.jors.2600769)

open shop, batching, group technology, approximation

Strusevich, V.A. (2000) Group technology approach to the open shop scheduling problem with batch setup times. Operations Research Letters, 26 (4). pp. 181-192. ISSN 0167-6377 (doi:https://doi.org/10.1016/S0167-6377(00)00021-3)

open shop, complexity, dynamic programming, fully polynomial approximation scheme, worst-case analysis, approximation

Strusevich, V.A. and Hall, L.A. (1997) An open shop scheduling problem with a non-bottleneck machine. Operations Research Letters, 21 (1). pp. 11-18. ISSN 0167-6377 (doi:https://doi.org/10.1016/S0167-6377(97)00030-8)

open shop, machine availability, approximation scheme

Kubzin, Mikhail A., Strusevich, Vitaly A., Breit, J. and Schmidt, G. (2006) Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints. Naval Research Logistics, 53 (1). pp. 16-23. ISSN 0894-069X (doi:https://doi.org/10.1002/nav.20122)

open shop, transportation time, approximation, worst-case analysis

Strusevich, V.A. (1999) A heuristic for the two-machine open-shop scheduling problem with transportation times. Discrete Applied Mathematics, 93 (2-3). pp. 287-304. ISSN 0166-218X (doi:https://doi.org/10.1016/S0166-218X(99)00115-8)

open shop,complexity, approximation

Shafransky, Y.M. and Strusevich, V.A. (1998) The open shop scheduling problem with a given sequence of jobs on one machine. Naval Research Logistics (NRL), 45 (7). pp. 705-731. ISSN 0894-069X (Print), 1520-6750 (Online) (doi:https://doi.org/10.1002/(SICI)1520-6750(199810)45:7<705::AID-NAV4>3.0.CO;2-F)

parallel dedicated machines, non-shared resources, complexity, approximation, worst-case analysis

Kelleler, H. and Strusevich, V.A. (2002) Scheduling parallel dedicated machines under a single non-shared resource. European Journal of Operational Research, 147 (2). pp. 345-364. ISSN 0377-2217 (doi:https://doi.org/10.1016/S0377-2217(02)00246-1)

parallel identical machines; resource constraints; group technology; approximation

Strusevich, Vitaly A. (2020) Approximation algorithms for makespan minimization on identical parallel machines under resource constraints. Journal of the Operational Research Society, 72 (9). pp. 2135-2146. ISSN 0160-5682 (Print), 1476-9360 (Online) (doi:https://doi.org/10.1080/01605682.2020.1772019)

polymatroid optimization, divide-and-conquer algorithm, scheduling

Shakhlevich, Natalia V., Shioura, Akiyoshi and Strusevich, Vitaly A. (2008) Fast divide-and-conquer algorithms for preemptive scheduling problems with controllable processing times - a polymatroid optimization approach. In: Algorithms – ESA 2008 : 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings. Lecture Notes in Computer Science (5193). Springer Verlag, Berlin/Heidelberg, Germany, pp. 756-767. ISBN 978-3-540-87743-1 (doi:https://doi.org/10.1007/978-3-540-87744-8_63)

production, scheduling, multiple machine, maintenance, replacement

Kubzin, M.A. and Strusevich, V.A. (2006) Planning machine maintenance in two-machine shop scheduling. Operations Research, 54 (4). pp. 789-800. ISSN 0030-364X (Print), 1526-5463 (Online) (doi:https://doi.org/10.1287/opre.1060.0301)

production-scheduling, open-shop, flow-shop, analysis of algorithms, computational complexity, suboptimal algorithms

Glass, C.A., Potts, C.N. and Strusevich, V.A. (2001) Scheduling batches with sequential job processing for two-machine flow and open shops. INFORMS Journal on Computing, 13 (2). pp. 120-137. ISSN 1091-9856 (Print), 1526-5528 (Online) (doi:https://doi.org/10.1287/ijoc.13.2.120.10521)

production/scheduling, approximations/heuristic, production/scheduling, sequencing, deterministic, multiple machine

Rustogi, Kabir and Strusevich, Vitaly A. (2013) Parallel machine scheduling: Impact of adding extra machines. Operations Research, 61 (5). pp. 1243-1257. ISSN 0030-364X (Print), 1526-5463 (Online) (doi:https://doi.org/10.1287/opre.2013.1208)

production/scheduling, flow shop, approximations/heuristic, worst-case analysis

Chen, Bo, Glass, Celia A., Potts, Chris N. and Strusevich, Vitaly A. (1996) A new heuristic for three-machine flow shop scheduling. Operations Research, 44 (6). pp. 891-898. ISSN 0030-364X (Print), 1526-5463 (Online) (doi:https://doi.org/10.1287/opre.44.6.891)

programming: linear; production scheduling: deterministic, single machine; analysis of algorithms: computational complexity

Shioura, Akiyoshi, Shakhlevich, Natalia V. and Strusevich, Vitaly (2016) Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines. INFORMS Journal on Computing, 28 (1). pp. 148-161. ISSN 1091-9856 (Print), 1526-5528 (Online) (doi:https://doi.org/10.1287/ijoc.2015.0660)

quadratic boolean programming, approximation, scheduling

Strusevich, Vitaly A. and Kellerer, Hans (2013) Approximation schemes for quadratic Boolean programming problems and their scheduling applications. In: OR55 Annual Conference - Keynote Papers and Extended Abstracts. Operational Research Society Limited, Birmingham, UK, pp. 73-85. ISBN 0903440555

quadratic knapsack, half-product, singlemachine scheduling, FPTAS

Kellerer, Hans and Strusevich, Vitaly A. (2011) The symmetric quadratic knapsack problem: approximation and scheduling applications. 4OR: A Quarterly Journal of Operations Research, 10 (2). pp. 111-161. ISSN 1619-4500 (Print), 1614-2411 (Online) (doi:https://doi.org/10.1007/s10288-011-0180-x)

quadratic knapsack, single machine scheduling, earliness-tardiness, FPTAS

Kellerer, Hans and Strusevich, Vitaly A. (2010) Minimizing total weighted earliness-tardiness on a single machine around a small common due date: an FPTAS using quadratic knapsack. International Journal of Foundations of Computer Science (IJFCS), 21 (3). pp. 357-383. ISSN 0129-0541 (Print), 1793-6373 (Online) (doi:https://doi.org/10.1142/S0129054110007301)

quadratic knapsack, single machine scheduling, total weighted completion time, availability constraints, scheduling agents, FPTAS

Kellerer, Hans and Strusevich, Vitaly A. (2008) Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica, 57 (4). pp. 769-795. ISSN 0178-4617 (Print), 1432-0541 (Online) (doi:https://doi.org/10.1007/s00453-008-9248-1)

re-entrant shop scheduling, approximation algorithm, worst-case analysis,

Drobouchevitch, I. G. and Strusevich, V. A. (1999) A heuristic algorithm for two-machine re-entrant shop scheduling. Annals of Operations Research, 86. pp. 417-439. ISSN 0254-5330 (Print), 1572-9338 (Online) (doi:https://doi.org/10.1023/A:1018927407164)

scheduling algorithms, batch,on-line, analytic approximations

Potts, Chris N., Strusevich, Vitaly A. and Whitehead, Jonathan D. (2006) On-line algorithms for single machine scheduling with family setup times. In: 12th IFAC Symposium on Information Control Problems in Manufacturing, 2006 [Proceedings]. Information Control Problems in Manufacturing (12:1). International Federation of Automatic Control, Laxenburg, Austria, pp. 135-141. ISBN 9783902661043 (doi:https://doi.org/10.3182/20060517-3-FR-2903.00084)

scheduling with transportation, open shop, approximation algorithm,

Lushchakova, Irina N., Soper, Alan J. ORCID: 0000-0002-0901-9803 and Strusevich, Vitaly A. (2008) Transporting jobs through a two-machine open shop. Naval Research Logistics (NRL), 56 (1). pp. 1-18. ISSN 0894-069X (Print), 1520-6750 (Online) (doi:https://doi.org/10.1002/nav.20323)

scheduling with transportation, parallel machines, FPTAS,

Kellerer, Hans, Soper, Alan J. ORCID: 0000-0002-0901-9803 and Strusevich, Vitaly A. (2010) Transporting jobs through a processing center with two parallel machines. In: Wu, Weili and Daescu, Ovidiu, (eds.) Combinatorial Optimization and Applications: 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I. Lecture Notes in Computer Science (6508). Springer Berlin Heidelberg, Berlin, Germany, pp. 408-422. ISBN 978364274575 ISSN 0302-9743 (doi:https://doi.org/10.1007/978-3-642-17458-2_33)

scheduling with transportation, parallel machines, approximation scheme,

Kellerer, Hans, Soper, Alan J. ORCID: 0000-0002-0901-9803 and Strusevich, Vitaly A. (2012) Preemptive scheduling on two identical parallel machines with a single transporter. Journal of Combinatorial Optimization, 25 (2). pp. 279-307. ISSN 1382-6905 (Print), 1573-2886 (Online) (doi:https://doi.org/10.1007/s10878-012-9511-x)

scheduling, Half-Product, quadratic knapsack, scheduling with rejection, scheduling with controllable processing times, FPTAS

Kellerer, Hans and Strusevich, Vitaly (2013) Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product. European Journal of Operational Research, 228 (1). pp. 24-32. ISSN 0377-2217 (doi:https://doi.org/10.1016/j.ejor.2012.12.028)

scheduling, Vyacheslav S. Tanaev, mathematical analyses

Blazewicz, Jacek, Burke, Edumnd K., Gordon, Valery S., Kovalyov, Mikhail Y., Shafransky, Yakov M. and Strusevich, Vitaly A. (2011) Editorial: new branches, old roots. Journal of Scheduling, 15 (4). pp. 399-401. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1007/s10951-011-0262-9)

scheduling, batching, polynomial algorithm, NP-hard, open shop, job shop, flow shop

Potts, C.N., Strusevich, V.A. and Tautenhahn, T. (2001) Scheduling batches with simultaneous job processing for two-machine shop problems. Journal of Scheduling, 4 (1). pp. 25-51. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1002/1099-1425(200101/02)4:1<25::AID-JOS58>3.0.CO;2-7)

scheduling, computer modelling

Gordon, Valery S., Proth, Jean-Marie and Strusevich, Vitaly A. (2004) Scheduling with due-date assignment. In: Leung, Joseph Y.-T., (ed.) Handbook of Scheduling: Algorithms, Models and Performance Analysis. Chapman & Hall/CRC Computer Information Science . CRC Press LLC, Florida, USA, p. 21. ISBN 9781584883975

scheduling, due date assignment, precedence constraints, deterioration, learning, maintenance activity

Gordon, Valerie, Strusevich, Vitaly and Dolgui, Alexandre (2011) Scheduling with due date assignment under special conditions on job processing. Journal of Scheduling, 15 (4). pp. 447-456. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1007/s10951-011-0240-2)

scheduling, flexibility, robustness, flow shop, job shop, open shop

Esswein, Carl, Billaut, Jean-Charles and Strusevich, Vitaly A. (2005) Two-machine shop scheduling: Compromise between flexibility and makespan value. European Journal of Operational Research, 167 (3). pp. 796-809. ISSN 0377-2217 (Print), 0377-2217 (Online) (doi:https://doi.org/10.1016/j.ejor.2004.01.029)

scheduling, flow shop, batch setup times, approximation algorithm, performance analysis

Chen, Bo, Potts, Chris N. and Strusevich, Vitaly A. (1998) Approximation algorithms for two-machine flow shop scheduling with batch setup times. Mathematical Programming, 82 (1-2). pp. 255-271. ISSN 0025-5610 (Print), 1436-4646 (Online) (doi:https://doi.org/10.1007/BF01585875)

scheduling, flow shop, makespan, approximation algorithm, polynomial time approximation scheme

Gupta, Jatinder N.D., Koulamas, Christos P., Kyparisis, George J., Potts, Chris N. and Strusevich, Vitaly A. (2004) Scheduling three-operation jobs in a two-machine flow shop to minimize makespan. Annals of Operations Research, 129 (1-4). pp. 171-185. ISSN 0254-5330 (Print), 1572-9338 (Online) (doi:https://doi.org/10.1023/B:ANOR.0000030687.72169.c7)

scheduling, history, milestones

Potts, C.N. and Strusevich, V.A. (2009) Fifty years of scheduling: a survey of milestones. Journal of the Operational Research Society, 60 (S1). S41-S68. ISSN 0160-5682 (Print), 1476-9360 (Online) (doi:https://doi.org/10.1057/jors.2009.2)

scheduling, maintenance, sequencing, deterioration, single machine, assignment problem

Rustogi, Kabir and Strusevich, Vitaly A. (2012) Single machine scheduling with general positional deterioration and rate-modifying maintenance. Omega, 40 (6). pp. 791-804. ISSN 0305-0483 (doi:https://doi.org/10.1016/j.omega.2011.12.007)

scheduling, open shop, batching, group technology, approximation

Billaut, Jean-Charles, Gribkovskaia, Irina and Strusevich, Vitaly (2008) An improved approximation algorithm for the two-machine open shop scheduling problem with family setup times. IIE Transactions, 40 (4). pp. 478-493. ISSN 1545-8830 (electronic) 0740-817X (paper) (doi:https://doi.org/10.1080/07408170701592473)

scheduling, open shop, batching, polynomial-time algorithm

Lee, Chung-Yee, Gribkovskaia, Irina, Strusevich, Vitaly A. and de Werra, Dominique (2006) Three is easy, two is hard: open shop sum-batch scheduling problem refined. Operations Research Letters, 34 (4). pp. 459-464. ISSN 0167-6377 (doi:https://doi.org/10.1016/j.orl.2005.07.006)

scheduling, parallel dedicated machines, resource constraints, complexity, approximation

Kellerer, Hans and Strusevich, Vitaly A. (2008) Scheduling parallel dedicated machines with the speeding-up resource. Naval Research Logistics (NRL), 55 (5). pp. 377-389. ISSN 0894-069X (Print), 1520-6750 (Online) (doi:https://doi.org/10.1002/nav.20292)

Kelleler, H. and Strusevich, V.A. (2003) Scheduling problems for parallel dedicated machines under multiple resource constraints. Discrete Applied Mathematics, 133 (1-3). pp. 45-68. ISSN 0166-218X (doi:https://doi.org/10.1016/S0166-218X(03)00433-5)

scheduling, parallel dedicated machines, single server, complexity, approximation

Glass, Celia A., Shafransky, Yakov M. and Strusevich, Vitaly A. (2000) Scheduling for parallel dedicated machines with a single server. Naval Research Logistics, 47 (4). pp. 304-328. ISSN 0894-069X (Print), 1520-6750 (Online) (doi:https://doi.org/10.1002/(SICI)1520-6750(200006)47:4<304::AID-NAV3>3.0.CO;2-1)

scheduling, sequencing, permutation, priority-generating function, symmetric function, mixed graph, parametric decomposition, Minsk Group, Vyacheslav Tanaev

Gordon, V.S., Kovalyov, M.Y., Levin, G.M., Shafransky, Y.M., Sotskov, Y.N., Strusevich, V.A. and Tuzikov, A.V. (2011) Vyacheslav Tanaev: contributions to scheduling and related areas. Journal of Scheduling, 15 (4). pp. 403-418. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1007/s10951-011-0230-4)

scheduling, single machine, parallel machines, controllable processing times

Shioura, Akiyoshi, Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2018) Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost. Journal of Global Optimization, 76 (3). pp. 471-490. ISSN 0925-5001 (Print), 1573-2916 (Online) (doi:https://doi.org/10.1007/s10898-018-0686-2)

scheduling, single machine, parallel machines, positional effects, job deterioration, assignment problem

Rustogi, Kabir and Strusevich, Vitaly A. (2012) Simple matching vs linear assignment in scheduling models with positional effects: A critical review. European Journal of Operational Research, 222 (3). pp. 393-407. ISSN 0377-2217 (doi:https://doi.org/10.1016/j.ejor.2012.04.037)

shop scheduling, approximation algorithm, worst-case analysis

Strusevich, V.A., Drobouchevitch, I.G. and Shakhlevich, N.V. (2002) Three-machine shop scheduling with partially ordered processing routes. Journal of the Operational Research Society, 53 (5). pp. 574-582. ISSN 0160-5682 (Print), 1476-9360 (Online) (doi:https://doi.org/10.1057/palgrave.jors.2601329)

shop scheduling, makespan minimization, partially ordered route, approximation

Quibell, Richard and Strusevich, Vitaly A. (2014) An approximation algorithm for the three-machine scheduling problem with the routes given by the same partial order. Computers & Industrial Engineering, 76. pp. 347-359. ISSN 0360-8352 (doi:https://doi.org/10.1016/j.cie.2014.08.009)

shop scheduling, precedence constraints, computational complexity

Strusevich, V.A. (1997) Shop scheduling problems under precedence constraints. Annals of Operations Research, 69. pp. 351-377. ISSN 0254-5330 (Print), 1572-9338 (Online) (doi:https://doi.org/10.1023/A:1018997431986)

single machine scheduling

Gordon, V.S. and Strusevich, V.A. (2008) Schedules with due-date assignment and position-dependent processing times. Doklady of the National Academy of Sciences of Belarus, 52 (5). pp. 24-30. ISSN 0002-354X

single machine scheduling, common due date assignment, SLK due date assignment, positionally dependent processing times

Gordon, Valery S. and Strusevich, Vitaly A. (2009) Single machine scheduling and due date assignment with positionally dependent processing times. European Journal of Operational Research, 198 (1). pp. 57-62. ISSN 0377-2217 (doi:https://doi.org/10.1016/j.ejor.2008.07.044)

single machine scheduling, deteriorating jobs, learning effect, precedence constraints, priority-generating functions

Gordon, V.S., Potts, C.N., Strusevich, V.A. and Whitehead, J.D. (2008) Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation. Journal of Scheduling, 11 (5). pp. 357-370. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1007/s10951-008-0064-x)

single machine scheduling, due date assignment

Gordon, Valery, Proth, Jean-Marie and Strusevich, Vitaly (2005) Single machine scheduling and due date assignment under series-parallel precedence constraints. Central European Journal of Operations Research, 13 (1). p. 15.

single machine scheduling, due date assignment, precedence constraints, earliness penalties

Gordon, V.S. and Strusevich, V.A. (1998) Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment. Computers & Operations Research, 26 (2). pp. 157-177. ISSN 0305-0548 (doi:https://doi.org/10.1016/S0305-0548(98)00055-0)

single machine scheduling, machine non-availability, total weighted completion time, approximation algorithm

Kellerer, Hans, Kubzin, Mikhail A. and Strusevich, Vitaly A. (2009) 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, 199 (1). pp. 111-116. ISSN 0377-2217 (doi:https://doi.org/10.1016/j.ejor.2008.11.003)

single machine scheduling, parallel machine scheduling, controllable processing times, bicriteria problems, polymatroids, greedy algorithms

Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2005) Pre-emptive scheduling problems with controllable processing times. Journal of Scheduling, 8 (3). pp. 233-253. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1007/s10951-005-6813-1)

single machine scheduling, time-dependent linear deterioration, rate-modifying maintenance, sequencing, maintenance, deterioration, time-dependent effects, assignment problem

Rustogi, Kabir and Strusevich, Vitaly A. (2014) Single machine scheduling with time-dependent linear deterioration and rate-modifying maintenance. Journal of the Operational Research Society, 66 (3). pp. 500-515. ISSN 0160-5682 (Print), 1476-9360 (Online) (doi:https://doi.org/10.1057/jors.2014.18)

single machine scheduling, weighted total tardiness, dynamic programming, FPTAS

Kelleler, Hans and Strusevich, Vitaly a. (2006) A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. Theoretical Computer Science, 369. pp. 230-238. ISSN 0304-3975 (doi:https://doi.org/10.1016/j.tcs.2006.08.030)

single machine scheduling; controllable processing times; polymatroid; base polyhedron

Shakhlevich, Natalia V., Shioura, Akiyoshi and Strusevich, Vitaly A. (2009) Single machine scheduling with controllable processing times by submodular optimization. International Journal of Foundations of Computer Science, 20 (2). pp. 247-269. ISSN 0129-0541 (Print), 1793-6373 (Online) (doi:https://doi.org/10.1142/S0129054109006541)

single machine, deterioration, maintenance, approximation scheme, subset-sum problem, Half-Product Problem

Kellerer, Hans, Rustogi, Kabir and Strusevich, Vitaly A. (2012) Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance. Journal of Scheduling, 16 (6). pp. 675-683. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1007/s10951-012-0287-8)

submodular optimization, parallel machine scheduling, controllable processing times, bicriteria problems

Shioura, Akiyoshi, Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2013) A submodular optimization approach to bicriteria scheduling problems with controllable processing times on parallel machines. SIAM Journal on Discrete Mathematics, 27 (1). pp. 186-204. ISSN 0895-4801 (Print), 1095-7146 (Online) (doi:https://doi.org/10.1137/110843836)

two machine scheduling, incompatibility graph, max-batch, polynomial algorithm

Lushchakova, Irina N. and Strusevich, Vitaly A. (2010) Scheduling incompatible tasks on two machines. European Journal of Operational Research, 200 (2). pp. 334-346. (doi:https://doi.org/10.1016/j.ejor.2009.01.029)

two-stage no-wait scheduling models, setup time, removal time

Gupta, J.N.D., Strusevich, V.A. and Zwaneveld, C.M. (1997) Two-stage no-wait scheduling models with setup and removal times separated. Computers & Operations Research, 24 (11). pp. 1025-1031. ISSN 0305-0548 (doi:https://doi.org/10.1016/S0305-0548(97)00018-X)

uniform parallel machine scheduling, controllable processing times, generalized polymatroid, maximum flow

Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2007) Preemptive scheduling on uniform parallel machines with controllable job processing times. Algorithmica, 51 (4). pp. 451-473. ISSN 0178-4617 (Print), 1432-0541 (Online) (doi:https://doi.org/10.1007/s00453-007-9091-9)

unrelated parallel machines; power of preemption; quality of a single preemption

Soper, Alan ORCID: 0000-0002-0901-9803 and Strusevich, Vitaly (2022) Preemptive and non-preemptive scheduling on two unrelated parallel machines. Journal of Scheduling, 2022. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1007/s10951-022-00753-7)

This list was generated on Sat Jan 28 19:01:04 2023 UTC.