Professor Chris Potts

School of Mathematics
University of Southampton
University Road
Southampton
SO17 1BJ

Position: Professor
Research group: Operational Research
Location: 54/10021
Extension: 23651
Telephone: (023) 8059 3651
Fax: (023) 8059 5147
Location: 54/10021
Extension: 23651
Telephone: (023) 8059 3651

Email Professor Chris Potts

Teaching responsibilities for Professor Chris Potts
Module title Module code Discipline Role
Algorithms MATH2014 Mathematics Course leader
Case Studies MATH6119 Mathematics Course leader
Deterministic OR Methods MATH6002 Mathematics Course leader
Introduction to Operational Research MATH2013 Mathematics Course leader
OR/MS in Transportation MATH6015 Mathematics Course leader
Stochastic OR Methods MATH6004 Mathematics Tutor

Publications

Smith, Honora K., Harper, Paul R., Potts, Chris N. and Thyle, Ann (2009) Planning sustainable community health schemes in rural areas of developing countries. European Journal of Operational Research, 193, (3), 768-777. (doi:10.1016/j.ejor.2007.07.031)
Potts, C.N. and Whitehead, J.D. (2007) Heuristics for a coupled-operation scheduling problem. Journal of the Operational Research Society, 58, (10), 1375-1388. (doi:10.1057/palgrave.jors.2602272)
Lee, L.S., Potts, C. and Bennell, J.A. (2007) A genetic algorithm for symmetric TSP with due dates. In, 3rd International Conference on Research and Education in Mathematics, Kuala Lumpar, Malaysia, 10-12 Apr 2007. .
Smith, Honora K., Harper, Paul R. and Potts, Chris N. (2007) Location modelling for community healthcare facilities. In, The 33rd International Conference on Operational Research Applied to Health Services (ORAHS2007), Saint-Étienne, France, 15-20 Jul 2007. Saint-Etienne, France, .
Ni, Jia, Bennell, Julia, Thomas, Lyn and Potts, Chris (2006) Feature selection and validation for mass spectral data in proteomics. In, 21st European Conference on Operational Research (EURO XXI), Reykjavic, Iceland, 02-05 Jul 2006. .
Crauwels, H.A.J., Potts, C.N., Van Oudheusden, D. and Van Wassenhove, L.N. (2005) Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs. Journal of Scheduling, 8, (2), 161-177. (doi:10.1007/s10951-005-6365-4)
Ghirardi, M. and Potts, C.N. (2005) Makespan minimization for unrelated parallel machines: a recovering beam search approach. European Journal of Operational Research, 165, (2), 457-467. (doi:10.1016/j.ejor.2004.04.015)
Hall, Nicholas and Potts, Chris (2005) The coordination of scheduling and batch deliveries. Annals of Operations Research, 135, (1), 41-64. (doi:10.1007/s10479-005-6234-8)
Anderson, Edward J. and Potts, Chris N. (2004) Online scheduling of a single machine to minimize total weighted completion time. Mathematics of Operations Research, 29, (3), 686-697. (doi:10.1287/moor.1040.0092)
Gupta, Jatinder N.D., Koulamas, Christos P., Kyparisis, George J., Potts, Chris N. and Strusevich, Vitality A. (2004) Scheduling three-operation jobs in a two-machine flow shop to minimize makespan: Models and algorithms for planning and scheduling problems. Annals of Operations Research, 129, (1-4), 171-185. (doi:10.1023/B:ANOR.0000030687.72169.c7)
Hall, Nicholas G. and Potts, Chris N. (2004) Rescheduling for new orders. Operations Research, 52, (3), 440-453. (doi:10.1287/opre.1030.0101)
Hall, Nicholas G. and Potts, Chris N. (2003) Supply chain scheduling: batching and delivery. Operations Research, 51, (4), 566-584. (doi:10.1287/opre.51.4.566.16106)
Kovalyov, M.Y., Potts, C.N. and Strusevich, V.A. (2003) Batching decisions for assembly production systems. European Journal of Operational Research, 157, (3), 620-642. (doi:10.1016/S0377-2217(03)00250-9)
Congram, Richard K., Potts, Chris N. and van de Velde, Steef L. (2002) An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS Journal on Computing, 14, (1), 52-67. (doi:10.1287/ijoc.14.1.52.7712)
Bennell, J.A., Potts, C.N. and Whitehead, J.D. (2002) Local search algorithms for the min-max loop layout problem. Journal of the Operational Research Society, 53, (10), 1109-1117. (doi:10.1057/palgrave.jors.2601269)
Gerodimos, A.E., Glass, C.A. and Potts, C.N. (2001) Scheduling of customised jobs on a single machine under item availability. IIE Transactions, 33, (11), 975-984.
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), 120-137. (doi:10.1287/ijoc.13.2.120.10521)
Hall, Nicholas G., Lesaoana, Maseka and Potts, Chris N. (2001) Scheduling with fixed delivery dates. Operations Research, 49, (1), 134-144. (doi: 10.1287/opre.49.1.134.11192)
Kashyrskikh, K.N., Potts, C.N. and Sevastianov, S.V. (2001) A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates. Discrete Applied Mathematics, 114, (1-3), 255-271. (doi:10.1016/S0166-218X(00)00374-7)
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), 25-51. (doi:10.1002/1099-1425(200101/02)4:1<25::AID-JOS58>3.0.CO;2-7)
Potts, C.N. and Whitehead, J.D. (2001) Workload balancing and loop layout in the design of a flexible manufacturing system. European Journal of Operational Research, 129, (2), 326-336. (doi:10.1016/S0377-2217(00)00230-7)
Email Professor Chris Potts