Phone:: (023) 8059 3651
Email:: C.N.Potts@soton.ac.uk

Professor Chris Potts

Professor of Operational Research

Related links

Professor Chris Potts is a Professor within Mathematical Sciences at the University of Southampton.

Education

University of Manchester, BSc in Mathematics
University of Hull, MSc in Operational Research
University of Birmingham, PhD in Operational research

Current Position

Professor of Operational Research

Research

Responsibilities

Publications

Teaching

Contact

Research interests

Research Interests

Combinatorial Optimization, especially scheduling in production and transport.

Research Projects

Air traffic management: scheduling of airport runways to improve throughput while maintaining minimum separation times between aircraft.

Train scheduling: increasing usage of the capacity imposed by the current infrastructure.

Vehicle routing and scheduling: design of local search methods for non-standard models that capture many of constraints that are present in real-world problems.

Production scheduling: design of models and development of algorithms for problems that are more closely related to industry practice than those of classical scheduling.

Research group

Operational Research

Affiliate research groups

Computational Optimisation, Transportation, Production Planning and Supply Chain

Research project(s)

Research work in rail capacity at Southampton was initiated with the OCCASION project (2010-2012), followed-up with a Knowledge Transfer Secondment with Arup (2013-14) and continues with the DITTO project (2014-2017). Research work on rail demand forecasting at Southampton was initiated with Rail Research UK (2003-2010) and has continued with a series of grants, contracts and consultancy studies.

Leading Southampton's contribution to the LANCS Initiative, a £13M project in collaboration with Lancaster, Nottingham and Cardiff to increase research capacity in foundational Operational Research

Articles

Armstrong, J., Preston, J., Potts, C., Bektas, T., & Paraskevopoulos, D. (2017). Addressing nodal constraints on railway capacity. Proceedings of the Institution of Mechanical Engineers, Part F: Journal of Rail and Rapid Transit, 231(5), 637-646. DOI: 10.1177/0954409717706271
Bektas, T., Xie, F., & Potts, C. (2017). Iterated local search for workforce scheduling and routing problems. Journal of Heuristics, 23(6), 471-500. DOI: 10.1007/s10732-017-9347-8
Penn, M. L., Potts, C. N., & Harper, P. R. (2017). Multiple criteria mixed-integer programming for incorporating multiple factors into the development of master operating theatre timetables. European Journal of Operational Research, 262(1), 194-206. DOI: 10.1016/j.ejor.2017.03.065
Shelbourne, B. C., Battarra, M., & Potts, C. (2017). The vehicle routing problem with release and due dates. INFORMS Journal on Computing, 29(4), 705-723. DOI: 10.1287/ijoc.2017.0756
Paraskevopoulos, D., Bektas, T., Crainic, T. G., & Potts, C. N. (2016). A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem. European Journal of Operational Research, 1-34. DOI: 10.1016/j.ejor.2015.12.051
Bennell, J. A., Mesgarpour, M., & Potts, C. N. (2016). Dynamic scheduling of aircraft landings. European Journal of Operational Research, 258(1), 315-327. DOI: 10.1016/j.ejor.2016.08.015
Chaiwuttisak, P., Smith, H., Wu, Y., Potts, C., Sakuldamrongpanich, T., & Pathomsiri, S. (2016). Location of low-cost blood collection and distribution centres in Thailand. Operations Research for Health Care, 1-14. DOI: 10.1016/j.orhc.2016.02.001
Cabo, M., Possani, E., Potts, C. N., & Song, X. (2015). Split-merge: Using exponential neighborhood search for scheduling a batching machine. Computers & Operations Research, 63, 125-135. DOI: 10.1016/j.cor.2015.04.017
Subramanian, A., Battarra, M., & Potts, C. N. (2014). An Iterated Local Search heuristic for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times. International Journal of Production Research, 1-14. DOI: 10.1080/00207543.2014.883472
Bennell, J. A., Lee, L. S., & Potts, C. N. (2013). A genetic algorithm for two-dimensional bin packing with due dates. International Journal of Production Economics, 145(2), 547-560. DOI: 10.1016/j.ijpe.2013.04.040
Smith, H., Harper, P., & Potts, C. N. (2012). Bicriteria efficiency/equity hierarchical location models for public service application. Journal of the Operational Research Society, 64, 500-512. DOI: 10.1057/jors.2012.68
Bennell, J. A., Mesgarpour, M., & Potts, C. N. (2011). Invited review. Airport runway scheduling. 4OR, (9), 115-138. DOI: 10.1007/s10288-011-0172-x
Kubzin, M. A., Potts, C. N., & Strusevich, V. A. (2009). Approximation results for flow shop scheduling problems with machine availability constraints. Computers and Operations Research, 36(2), 379-390. DOI: 10.1016/j.cor.2007.10.013
McDonald, R., Skipp, P., Potts, C. N., Thomas, L. C., O'Connor, D., & Bennell, J. (2009). Mining whole sample mass spectrometry proteomics data for biomarkers: an overview. Expert Systems with Applications, 36(3), 5333-5340. DOI: 10.1016/j.eswa.2008.06.133
Hall, N. G., Posner, M. E., & Potts, C. N. (2009). Online scheduling with known arrival times. Mathematics of Operations Research, 34(1), 92-102. DOI: 10.1287/moor.1080.0346
Smith, H. K., Harper, P. R., Potts, C. N., & Thyle, A. (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
Brauner, N., Finke, G., Lehoux-Lebacque, V., Potts, C., & Whitehead, J. D. (2009). Scheduling of coupled tasks and one-machine no-wait robotic cells. Computers and Operations Research, 36(2), 301-307. DOI: 10.1016/j.cor.2007.10.003
Lusa, A., & Potts, C. N. (2008). A variable neighbourhood search algorithm for the constrained task allocation problem. Journal of the Operational Research Society, 59(6), 812-822. DOI: 10.1057/palgrave.jors.2602413
Gordon, V. S., Potts, C. N., Strusevich, V. A., & Whitehead, J. D. (2008). Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation. Journal of Scheduling, 11(5), 357-370. DOI: 10.1007/s10951-008-0064-x
Potts, C. N., & 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
Crauwels, H. A. J., Potts, C. N., Van Oudheusden, D., & 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., & 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, N., & Potts, C. (2005). The coordination of scheduling and batch deliveries. Annals of Operations Research, 135(1), 41-64. DOI: 10.1007/s10479-005-6234-8
Anderson, E. J., & Potts, C. 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
Hall, N. G., & Potts, C. N. (2004). Rescheduling for new orders. Operations Research, 52(3), 440-453. DOI: 10.1287/opre.1030.0101
Gupta, J. N. D., Koulamas, C. P., Kyparisis, G. J., Potts, C. N., & Strusevich, V. 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
Kovalyov, M. Y., Potts, C. N., & 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
Hall, N. G., & Potts, C. N. (2003). Supply chain scheduling: batching and delivery. Operations Research, 51(4), 566-584. DOI: 10.1287/opre.51.4.566.16106
Congram, R. K., Potts, C. N., & van de Velde, S. 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., & 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
Kashyrskikh, K. N., Potts, C. N., & 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
Glass, C. A., Potts, C. N., & 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
Potts, C. N., Strusevich, V. A., & 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
Gerodimos, A. E., Glass, C. A., & Potts, C. N. (2001). Scheduling of customised jobs on a single machine under item availability. IIE Transactions, 33(11), 975-984.
Hall, N. G., Lesaoana, M., & Potts, C. N. (2001). Scheduling with fixed delivery dates. Operations Research, 49(1), 134-144. DOI: 10.1287/opre.49.1.134.11192
Potts, C. N., & 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
Sidney, J. B., Potts, C. N., & Sriskandarajah, C. (2000). A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups. Operations Research Letters, 26(4), 165-173. DOI: 10.1016/S0167-6377(00)00019-5
Hoogeveen, H., Potts, C. N., & Woeginger, G. J. (2000). On-line scheduling on a single machine: maximizing the number of early jobs. Operations Research Letters, 27(5), 193-197. DOI: 10.1016/S0167-6377(00)00061-4
Hall, N. G., Potts, C. N., & Sriskandarajah, C. (2000). Parallel machine scheduling with a common server. Discrete Applied Mathematics, 102(3), 223-243. DOI: 10.1016/S0166-218X(99)00206-1
Gerodimos, A. E., Glass, C. A., & Potts, C. N. (2000). Scheduling the production of two-component jobs on a single machine. European Journal of Operational Research, 120(2), 250-259. DOI: 10.1016/S0377-2217(99)00154-X
Potts, C. N., & Kovalyov, M. Y. (2000). Scheduling with batching: a review. European Journal of Operational Research, 120(2), 228-249. DOI: 10.1016/S0377-2217(99)00153-8

Conferences

Smith, H. K., Harper, P. R., & Potts, C. N. (2008). Community healthcare facilities:location and demand modelling. Paper presented at Second International Health and Social Care Modelling Conference (HSCM)2008, United Kingdom.
Smith, H. K., Harper, P. R., & Potts, C. N. (2008). Location modelling for community healthcare facilities. In Operations Research for Health Care Delivery Engineering (pp. 101-112). Saint-Etienne, France: Publications de L'Universite de Saint-Etienne.
Lee, L-S., Potts, C. N., & Bennell, J. A. (2007). A genetic algorithm for symmetric Travelling Salesman Problem with due dates. Paper presented at 3rd International Conference on Research and Education in Mathematics (ICREM 3), .
Lee, L. S., Potts, C., & Bennell, J. A. (2007). A genetic algorithm for symmetric TSP with due dates. Paper presented at 3rd International Conference on Research and Education in Mathematics, .
Smith, H., Harper, P., & Potts, C. (2006). An OR approach to planning sustainable community health schemes in rural areas of developing countries. poster discussion presentations: planning sustainable community health schemes in rural areas of developing countries using hierarchical location modelling.. Poster session presented at EURO XXI, European Conference on Operational Research, .
Ni, J., Bennell, J., Thomas, L., & Potts, C. (2006). Feature selection and validation for mass spectral data in proteomics. Paper presented at 21st European Conference on Operational Research (EURO XXI), .

Working Papers

Bennell, J., Pearson, N. A., & Potts, C. N. (2009). Driveable routes: solving shortest path problems in practice. (Discussion Papers in Centre for Operational Research, Management Science and Information Systems; No. CORMSIS-09-15). Southampton, UK: University of Southampton.
Bennell, J. A., Lee, L. S., & Potts, C. N. (2008). A genetic algorithm for two-dimensional bin packing with due dates. (Discussion Papers in Centre for Operational Research, Management Science and Information Systems; No. CORMSIS-08-16). Southampton, UK: University of Southampton.

MATH6002 Deterministic OR Methods

Professor Chris Potts
Building 54 Mathematical Sciences University of Southampton Highfield Southampton SO17 1BJ

Room Number:54/11007

Facsimile: (023) 8059 5147

Share this profile Share this on Facebook Share this on Google+ Share this on Twitter Share this on Weibo

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.