Items where School / Department / Research Groups is "School of Computing & Mathematical Sciences > Statistics & Operational Research Group"

Billaut, Jean-Charles, Gribkovskaia, Irina and Strusevich, Vitaly A. (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:10.1080/07408170701592473)

Chen, Anyue, Li, Junping and Ramesh, N.I. (2008) Probabilistic approach in weighted Markov branching processes. Statistics & Probability Letters, 78 (6). pp. 771-779. ISSN 0167-7152 (doi:10.1016/j.spl.2007.09.043)

Chen, Anyue, Zhang, Hanjun, Liu, Kai and Rennolls, Keith (2004) Birth-death processes with disaster and instantaneous resurrection. Advances in Applied Probability, 36 (1). pp. 267-292. ISSN 0001-8678 (doi:10.1239/aap/1077134473)

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:10.1007/s10951-008-0064-x)

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:10.1016/j.ejor.2008.07.044)

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:10.1016/j.tcs.2006.08.030)

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:10.1016/j.ejor.2008.11.003)

Kellerer, Hans and Strusevich, Vitaly A. (2010) 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:10.1007/s00453-008-9248-1)

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:10.1002/nav.20292)

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:10.1142/S0129054110007301)

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:10.1016/j.cor.2007.10.013)

Lushchakova, Irina N., Soper, Alan J. and Strusevich, Vitaly A. (2009) Transporting jobs through a two-machine open shop. Naval Research Logistics, 56 (1). pp. 1-18. ISSN 0894-069X (doi:10.1002/nav.20323)

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:10.1016/j.endm.2007.07.028)

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 (Electronic) (doi:10.1057/jors.2009.2)

Ramesh, N, Chen, A and Li, J (2006) General Harris regularity criterion for non-linear Markov branching processes. Statistics & Probability Letters, 76. pp. 446-452. ISSN 0167-7152 (doi:10.1016/j.spl.2005.08.014)

Ramesh, Nadarajah (2010) An illustration oriented approach in statistics education. In: CETL-MSOR Conference 2009: Conference Proceedings. The Maths, Stats & OR Network, Birmingham, UK, pp. 117-122. ISBN 978-0-9555914-7-1

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:10.1007/978-3-540-87744-8_63)

Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2008) 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:10.1007/s00453-007-9091-9)

Soper, Alan 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:10.1142/S012905410700484X)

Soper, Alan and Strusevich, Vitaly A. (2006) Two-machine flow shop scheduling with an interstage transporter: two shipments. In: 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

Soper, Alan 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:10.1142/S012905410700484X)

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

Wang, Meiqing and Lai, Choi-Hong (2008) Concise introduction to image processing using C++. Numerical Analysis and Scientific Computing Series . Chapman & Hall/CRC Press, Boca Raton, Florida , USA. ISBN 978-1-58488-897-0

Wang, Mingliang and Rennolls, Keith (2007) Bivariate distribution modeling with tree diameter and height data. Forest Science, 53 (1). pp. 16-24. ISSN 0015-749X

Wang, Meiqing, Liu, Rong and Lai, Choi-Hong (2006) Adaptive partition and hybrid method in fractal video compression. Computers & Mathematics with Applications, 51 (11). pp. 1715-1726. ISSN 0898-1221 (doi:10.1016/j.camwa.2006.05.009)

Wang, Mingliang (2005) Distributional modelling in forestry and remote sensing. PhD thesis, University of Greenwich.

Wang, Mingliang, Ramesh, Nadarajah I. and Rennolls, Keith (2007) The Richit-Richards family of distributions and its use in forestry. Canadian Journal of Forest Research, 37 (10). pp. 2052-2062. ISSN 0045-5067 (doi:10.1139/X07-023)

Zhang, Yong (2000) Use of spatial models and the MCMC method for investigating the relationship between road traffic pollution and asthma amongst children. PhD thesis, University of Greenwich.