Skip navigation

Browse by Journal Title

Browse by Journal Title

Up a level
Export as [feed] RSS
Group by: Creators | Item Type | Uncontrolled Keywords | No Grouping
Number of items: 29.

approximation algorithm

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:10.1023/A:1018927407164)

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:10.1023/B:ANOR.0000030687.72169.c7)

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:10.1023/A:1018964131329)

combinatorial optimisation

Walshaw, Chris ORCID: 0000-0003-0253-7779 (2004) Multilevel refinement for combinatorial optimisation problems. Annals of Operations Research, 131 (1-4). pp. 325-372. ISSN 0254-5330 (Print), 1572-9338 (Online) (doi:10.1023/B:ANOR.0000039525.80601.15)

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:10.1023/A:1018997431986)

flow shop

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:10.1023/B:ANOR.0000030687.72169.c7)

graph colouring

Walshaw, Chris ORCID: 0000-0003-0253-7779 (2004) Multilevel refinement for combinatorial optimisation problems. Annals of Operations Research, 131 (1-4). pp. 325-372. ISSN 0254-5330 (Print), 1572-9338 (Online) (doi:10.1023/B:ANOR.0000039525.80601.15)

graph partitioning

Walshaw, Chris ORCID: 0000-0003-0253-7779 (2004) Multilevel refinement for combinatorial optimisation problems. Annals of Operations Research, 131 (1-4). pp. 325-372. ISSN 0254-5330 (Print), 1572-9338 (Online) (doi:10.1023/B:ANOR.0000039525.80601.15)

lower bound

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:10.1023/A:1018982630730)

makespan

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:10.1023/B:ANOR.0000030687.72169.c7)

metaheuristic

Walshaw, Chris ORCID: 0000-0003-0253-7779 (2004) Multilevel refinement for combinatorial optimisation problems. Annals of Operations Research, 131 (1-4). pp. 325-372. ISSN 0254-5330 (Print), 1572-9338 (Online) (doi:10.1023/B:ANOR.0000039525.80601.15)

multilevel refinement

Walshaw, Chris ORCID: 0000-0003-0253-7779 (2004) Multilevel refinement for combinatorial optimisation problems. Annals of Operations Research, 131 (1-4). pp. 325-372. ISSN 0254-5330 (Print), 1572-9338 (Online) (doi:10.1023/B:ANOR.0000039525.80601.15)

NP-hard problem

Shakhlevich, Natalia V., Sotskov, Yuri N. and Werner, Frank (1999) Shop-scheduling problems with fixed and non-fixed machine orders of the jobs. Annals of Operations Research, 92. pp. 281-304. ISSN 0254-5330 (Print), 1572-9338 (Online) (doi:10.1023/A:1018943016617)

open shop scheduling

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:10.1023/A:1018982630730)

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:10.1023/A:1018964131329)

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:10.1023/A:1018982630730)

Shakhlevich, Natalia V., Sotskov, Yuri N. and Werner, Frank (1999) Shop-scheduling problems with fixed and non-fixed machine orders of the jobs. Annals of Operations Research, 92. pp. 281-304. ISSN 0254-5330 (Print), 1572-9338 (Online) (doi:10.1023/A:1018943016617)

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:10.1023/B:ANOR.0000030687.72169.c7)

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. ISSN 0254-5330 (Print), 1572-9338 (Online) (In Press) (doi:10.1007/s10479-018-2952-6)

precedence constraints

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:10.1023/A:1018997431986)

re-entrant shop scheduling

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:10.1023/A:1018927407164)

scheduling

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:10.1023/B:ANOR.0000030687.72169.c7)

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. ISSN 0254-5330 (Print), 1572-9338 (Online) (In Press) (doi:10.1007/s10479-018-2952-6)

shop scheduling

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:10.1023/A:1018997431986)

shop-scheduling

Shakhlevich, Natalia V., Sotskov, Yuri N. and Werner, Frank (1999) Shop-scheduling problems with fixed and non-fixed machine orders of the jobs. Annals of Operations Research, 92. pp. 281-304. ISSN 0254-5330 (Print), 1572-9338 (Online) (doi:10.1023/A:1018943016617)

travelling salesman

Walshaw, Chris ORCID: 0000-0003-0253-7779 (2004) Multilevel refinement for combinatorial optimisation problems. Annals of Operations Research, 131 (1-4). pp. 325-372. ISSN 0254-5330 (Print), 1572-9338 (Online) (doi:10.1023/B:ANOR.0000039525.80601.15)

Uniform parallel machines

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. ISSN 0254-5330 (Print), 1572-9338 (Online) (In Press) (doi:10.1007/s10479-018-2952-6)

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:10.1023/A:1018927407164)

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:10.1023/A:1018964131329)

This list was generated on Sun Oct 21 04:07:45 2018 BST.