Professor Celia Glass

Professor of Management Science

Bayes Business School , Faculty of Actuarial Science and Insurance

Contact

About

Overview

Celia A. Glass has worked as a Systems Analyst in Computer Aided Design at the GEC Laboratory, and as an Operational Research Analyst for the Mathematical Science Division HM Customs and Excise. She started her academic career as a senior lecturer in Operational Research at the School of Mathematics, Statistics and Computing, Thames Polytechnic London, and proceeded to a lectureship in the Faculty of Mathematical Studies of Southampton University. Celia Glass moved to City University London in 1999 as a senior lecturer before being granted a personal Chair of Operational Research in 2003, and then of Management Science in 2016, at Bayes Business School (formerly Cass).

Qualifications

  • BSc, Kings College London, United Kingdom
  • PhD, Kings College London, United Kingdom

Visiting appointments

  • Licence to Innovate, Scottish and Southern Energy, June 2008 - June 2009
  • Visiting Professor, Electronic Department, Queen Mary London University, October 2006 - September 2015
  • Discipline Hopping (mathematics-computing), Electronic Department, Queen Mary London University, January - September 2006

Memberships of professional organisations

  • Fellow, Operational Research Society, October 2005 - present
  • Fellow, London Mathematical Society, August 2003 - present
  • Fellow, Institute of Mathematics and its Applications, August 2003 - present
  • Member, referee & sit on grant selection panels, EPSRC College, 2001 - present
  • Member of accreditation panel and Fellow of ORS, the Opertational Research Society, accreditation panel
  • Member, advisory board of NATCOR, National (PhD), The Engineering and Physical Sciences Research Council (EPSRC)

Expertise

Primary topics

  • Management Science
  • Operations Research

Research

Research topics

Doctor Rostering

Software to provide optimised ergonomic doctor schedules for covering patient care with minimum risk. Provided as a customised service for the NHS by spin out company Nightglass Medical Rostering Ltd.

Operations Management for modern Call Centres

analytics for determining staffing levels and call routing to handle the complexities of diverse call types

Optimisation Algorithms of routing and scheduling in telecommunication

for wireless mesh networks, optical fibre networks, sensor networks - supported by various EPSRC grants

Combinatorics of acyclic graphs

theorems and algorithms for counting the number of acyclic orientations, and related parameters, of a graph - related to radio spectrum frequency assignment

Mathematics related to the Consecutive-Ones Matrix property

optimisation properties and algorithms - arising in the logistics of a food safety laboratory processing line and additionally useful in genome identification

Research students

Robert Schumacher

Attendance: October 2010 - October 2014, full-time

Thesis title: Counting Acyclic Orientations

Role: 1st Supervisor

Collins Teye-Ali

Attendance: August 2006 - July 2007, full-time

Thesis title: Production Logistics of a Microbiology Laboratory

Role: 1st Supervisor

Roger Knight

Attendance: September 2005 - November 2008, full-time

Thesis title: Optimisation methods for staff scheduling and rostering: an employee-friendly approach

Role: 1st Supervisor

Ian, B. Davies

Attendance: September 2002 - June 2007, full-time

Thesis title: the Frequency Assignment Problem

Role: 1st Supervisor

Hugo, R. Mills

Attendance: October 1998 - October 2003, full-time

Thesis title: Scheduling production of a specialised flour mill

Role: 1st Supervisor

Edgar Possani

Attendance: October 1997 - September 1999, full-time

Thesis title: Lot Streaming

Role: 1st Supervisor

Alexandros E. Gerodimos

Attendance: September 1995 - December 1998

Thesis title: Scheduling

Role: 1st Supervisor

Publications

Books (7)

  1. Glass, C.A., Kellerer, H. and Sugimoto, I. (2011). Aircraft departure Sequencing using Individual Constraint Position Shifting.
  2. Glass, C.A. and Levin, A. (2011). An efficient deployment algorithm for all-optical networks.
  3. Glass, C. and Mosheiov, G. (2011). Batch scheduling in a three-machine flow shop.
  4. Glass, C.A. and Knight, R.A. (2011). Call centre tour scheduling with employee preferences.
  5. Glass, C. and Davies, I.B. (2011). Restricted Frequency Assignment.
  6. Glass, C.A. (2011). The optimality gap in routing and wavelength assignment algorithms for pure-optical networks.
  7. Glass, C.A., Mason, S.C., Kutanoglu, E., Fowler, J.W. and Qu, P. (2011). The single machine multiple orders job scheduling problem.

Chapters (2)

  1. Glass, C.A. (2025). AI Rostering for NHS Doctors in Training: Enhancing Wellbeing with Mathematical Programming. Mathematics in Industry (pp. 139-145). Springer Nature Switzerland. ISBN 9783031486821.
  2. Glass, C., Anderson, E.A. and Potts, C.N. (1997). Machine Scheduling. In Aarts, E.H.L. and Lenstra, J.K. (Eds.), Local search in combinatorial optimization Chichester: Wiley.

Conference papers and proceedings (21)

  1. Glass, C.A. (2010). Minimizing the Number of Gap-Zeros in Binary Matrices. Combinatorial Seminar Mathematics Department, Queen Mary London University.
  2. Glass, C.A. (2010). Nurse and doctor ristering: what is a good roster? LANCS Healthcare custer workshop - Planning and Scheduling Applications of Operational Research in Healthcare Nottingham, UK.
  3. Glass, C.A. (2010). Periodic Scheduling for Wireless Mesh Networks. EURO xxiv Lisbon, Portugal.
  4. Glass, C.A. (2009). Rosters versas rotas for NHS nurses and doctors (in the UK). EURO xxiii.
  5. Glass, C.A. and Chakhlevitch, K. (2009). Scheduling in a micro-biological laboratory: heuristics for sequencing food sample tests, to co-ordinate with production of perishable media materials. MISTA Dublin, Ireland.
  6. Glass, C.A. and Knight, R.A. (2008). Call centre tour scheduling with employee preferences. OR50, annual conference of the Operational Research Society York, UK.
  7. Glass, C.A. (2008). Discrete algorithms for industrial applications: bottlenecks in call centres and micro-biology laboratories. SIAM UK/IE annual meeting Southampton/UK.
  8. Glass, C.A. (2008). Keynote talk: Mathematicians working with Engineers, an Optimality Gap. Combinatorics: when mathematics meets engineering Queen Mary, London University, UK.
  9. Glass, C.A. (2008). Routing and Wavelength Assignment of a pure-optical network: an Optimality Gap. Network Group seminar series, Queen Mary's College London/UK.
  10. Glass, C.A. (2008). Scheduling in telecommunication applications: the optimality gap. New Challenges in Scheduling Theory Marseille/France.
  11. Glass, C.A. and Chakhlevitch, K. (2008). Scheduling on parallel machines, with perishability time windows, inspired by the process of micro-biology food testing. International Symposium on Combinatorial Optimization Warwick/UK.
  12. Glass, C.A. (2006). Combinatorial Optimisation for Frequency Assignment. EUROxxi Reykjavik/Iceland.
  13. Glass, C. (2005). Advantages of discrete scheduling. Simluation and scheduling Schloss Dagstuhl, Computing research centre.
  14. Glass, C. (2005). How to maximize rewards in an incetivised made-to-rder scheduling environment. MISTA 2005 New York, US.
  15. Glass, C. (2004). Structural properties of the Frequency Assignment Problem. Combinatorial Optimisation (CO) 2004 Lancaster UK..
  16. Glass, C. (2003). Dynamic Programming for optimal insurance premium pricing. EURO/INFORMS2003 Istanbul, Turkey.
  17. Glass, C. (2002). Co-organiser and co-editor of procedings. Operational Resaerch Society Workshop on Local Search City University.
  18. Glass, C. (2001). How rationalising packing led to allocating bandwidth. North West OR Society group and Lancaster University Lancaster Managment School.
  19. Glass, C. (1998). New Approach to Graph Colouring. Seminar EPFL, Lausanne, Switzerland.
  20. Glass, C. (1998). Scheduling with batching. 16th International Symposium on Mathematical Programming Lausanne, Switzerland.
  21. Harrison, R., Glass, C.A., Deaton, E., George, K.M., Berghel, H. and Hedrick, G.E. Dynamic Programming in a Pure Functional Language. .

Journal articles (40)

  1. Glass, C.A. and Kim, E.-.S. (2015). Perfect periodic scheduling for binary tree routing in wireless networks. European Journal of Operational Research, 247(2), pp. 389-400. doi:10.1016/j.ejor.2015.05.031
  2. Kim, E.-.S. and Glass, C.A. (2015). Perfect periodic scheduling for binary tree routing in wireless networks. European Journal of Operational Research, 247(2), pp. 389-400. doi:10.1016/j.ejor.2015.05.031

    [publisher’s website]

  3. Kim, E.S. and Glass, C.A. (2014). Perfect periodic scheduling for three basic cycles. Journal of Scheduling, 17(1), pp. 47-65. doi:10.1007/s10951-013-0331-3

    [publisher’s website]

  4. Chakhlevitch, K., Glass, C.A. and Shakhlevich, N.V. (2013). Minimising the number of gap-zeros in binary matrices. European Journal of Operational Research, 229(1), pp. 48-58. doi:10.1016/j.ejor.2013.01.028
  5. Kim, E.-.S. and Glass, C.A. (2013). Perfect periodic scheduling for three basic cycles. Journal of Scheduling pp. 1-19
  6. Alfieri, A., Glass, C. and van de Velde, S. (2012). Two-machine lot streaming with attached setup times. IIE Transactions, 44(8), pp. 695-710. doi:10.1080/0740817x.2011.649384

    [publisher’s website]

  7. Glass, C.A. and Possani, E. (2011). Lot streaming multiple jobs in a flow shop. International Journal of Production Research, 49(9), pp. 2669-2681. doi:10.1080/00207543.2010.532935

    [publisher’s website]

  8. Chakhlevitch, K., Glass, C.A. and Kellerer, H. (2011). Batch machine production with perishability time windows and limited batch size. European Journal of Operational Research, 210(1), pp. 39-47. doi:10.1016/j.ejor.2010.10.033

    [publisher’s website]

  9. Chakhlevitch, K., Glass, C.A. and Sadd, P.A. (2011). Alleviating bottlenecks in a microbiology laboratory. Journal of Food Engineering, 103(4), pp. 377-387. doi:10.1016/j.jfoodeng.2010.11.007

    [publisher’s website]

  10. Chakhlevitch, K., Glass, C.A. and Sadd, P.A. (2011). Alleviating bottlenecks in a microbiology laboratory. Journal of Food Engineering, 103(4), pp. 377-387. doi:10.1016/j.jfoodeng.2010.11.007
  11. Gazo Cervero, A., Glass, C.A. and Phillips, C.I. (2011). Threshold-based energy management for wired communication networks. IEEE Communications Letters
  12. Chakhlevitch, K., Glass, C.A. and Kellerer, H. (2011). Batch machine production with perishability time windows and limited batch size. European Journal of Operational Research, 210, pp. 39-47
  13. Glass, C.A. and Knight, R.A. (2010). The nurse rostering problem: A critical appraisal of the problem structure. European Journal of Operational Research, 202(2), pp. 379-389. doi:10.1016/j.ejor.2009.05.046

    [publisher’s website]

  14. Glass, C.A. and van Oostrum, J.M. (2010). Bun splitting: A practical cutting stock problem. Annals of Operations Research, 179(1), pp. 15-33. doi:10.1007/s10479-008-0458-3

    [publisher’s website]

  15. Glass, C., Phillips, C. and Dong, S. (2009). Layered connection management for dynamic all-optical networks. IET Communications, 3(9), pp. 1520-1532. doi:10.1049/iet-com.2008.0531

    [publisher’s website]

  16. Chakhlevitch, K. and Glass, C.A. (2009). Scheduling reentrant jobs on parallel machines with a remote server. Computers and Operations Research, 36(9), pp. 2580-2589. doi:10.1016/j.cor.2008.11.007

    [publisher’s website]

  17. Glass, C.A. and Kellerer, H. (2007). Parallel machine scheduling with job assignment restrictions. Naval Research Logistics, 54(3), pp. 250-257. doi:10.1002/nav.20202

    [publisher’s website]

  18. Glass, C.A. and Herer, Y.T. (2006). On the equivalence of small batch assembly line balancing and lot streaming in a flow shop. International Journal of Production Research, 44(21), pp. 4587-4606. doi:10.1080/00207540600607119

    [publisher’s website]

  19. Glass, C.A. and Mills, H.R. (2006). Scheduling unit length jobs with parallel nested machine processing set restrictions. Computers and Operations Research, 33(3), pp. 620-638. doi:10.1016/j.cor.2004.07.010

    [publisher’s website]

  20. Glass, C.A. and Prügel-Bennett, A. (2005). A polynomially searchable exponential neighbourhood for graph colouring. Journal of the Operational Research Society, 56(3), pp. 324-330. doi:10.1057/palgrave.jors.2601815

    [publisher’s website]

  21. Glass, C.A., Potts, C.N. and Tuson, A.L. (2004). Editorial. Journal of the Operational Research Society, 55(7), pp. 685-686. doi:10.1057/palgrave.jors.2601772

    [publisher’s website]

  22. Glass, C.A. and Prügel-Bennett, A. (2003). Genetic Algorithm for Graph Coloring: Exploration of Galinier and Hao's Algorithm. Journal of Combinatorial Optimization, 7(3), pp. 229-236. doi:10.1023/A:1027312403532

    [publisher’s website]

  23. Glass, C.A. and Pr�gel Bennett, A. (2003). Genetic Algorithm for Graph Coloring Exploration of Galinier and Haos Algorithm. Journal of Combinatorial Optimization, 7, pp. 229-236
  24. Glass, C.A. (2002). Bag rationalisation for a food manufacturer. Journal of the Operational Research Society, 53(5), pp. 544-551. doi:10.1057/palgrave.jors.2601316

    [publisher’s website]

  25. GERODIMOS, A.E., GLASS, C.A. and POTTS, C.N. (2001). Scheduling of customized jobs on a single machine under item availability. IIE Transactions, 33(11), pp. 975-984. doi:10.1080/07408170108936888

    [publisher’s website]

  26. 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. doi:10.1287/ijoc.13.2.120.10521

    [publisher’s website]

  27. Gerodimos, A.E., Glass, C.A. and Potts, C.N. (2001). IIE Transactions, 33(11), pp. 975-984. doi:10.1023/a:1010930216679

    [publisher’s website]

  28. Glass, C.A., Shafransky, Y.M. and Strusevich, V.A. (2000). Scheduling for parallel dedicated machines with a single server. NAVAL RESEARCH LOGISTICS, 47(4), pp. 304-328. doi:10.1002/(SICI)1520-6750(200006)47:4<304::AID-NAV3>3.3.CO;2-T

    [publisher’s website]

  29. Gerodimos, A.E., Glass, C.A. and Potts, C.N. (2000). Scheduling the production of two-component jobs on a single machine. European Journal of Operational Research, 120(2), pp. 250-259. doi:10.1016/s0377-2217(99)00154-x

    [publisher’s website]

  30. Glass, C.A., Gupta, J.N.D. and Potts, C.N. (1999). Two-Machine No-Wait Flow Shop Scheduling with Missing Operations. Mathematics of Operations Research, 24(4), pp. 911-924. doi:10.1287/moor.24.4.911

    [publisher’s website]

  31. Glass, C., Anily, S. and Hassin, R. (1999). Scheduling maintenance services to three machines. Annals of Operations Research, 86(0), pp. 375-391. doi:10.1023/A:1018971222185

    [publisher’s website]

  32. Glass, C., Gerodimos, A.E., Potts, C.N. and Tautenhahn, T. (1999). Scheduling multi-operation jobs on a single machine. Annals of Operations Research, 92(0), pp. 87-105. doi:10.1023/A:1018959420252

    [publisher’s website]

  33. Glass, C.A. and Potts, C.N. (1998). Structural Properties of Lot Streaming in a Flow Shop. Mathematics of Operations Research, 23(3), pp. 624-639. doi:10.1287/moor.23.3.624

    [publisher’s website]

  34. Anily, S., Glass, C.A. and Hassin, R. (1998). The scheduling of maintenance service. Discrete Applied Mathematics, 82(1-3), pp. 27-42. doi:10.1016/s0166-218x(97)00119-4

    [publisher’s website]

  35. Chen, B., Glass, C.A., Potts, C.N. and Strusevich, V.A. (1996). A New Heuristic for Three-Machine Flow Shop Scheduling. Operations Research, 44(6), pp. 891-898. doi:10.1287/opre.44.6.891

    [publisher’s website]

  36. Glass, C.A. and Potts, C.N. (1996). A comparison of local search methods for flow shop scheduling. Annals of Operations Research, 63(4), pp. 489-509. doi:10.1007/bf02156631

    [publisher’s website]

  37. Glass, C.A., Potts, C.N. and Shade, P. (1994). Unrelated parallel machine scheduling using local search. Mathematical and Computer Modelling, 20(2), pp. 41-52. doi:10.1016/0895-7177(94)90205-4

    [publisher’s website]

  38. Glass, C.A. (1994). Feasibility of scheduling lot sizes of two frequencies on one machine. European Journal of Operational Research, 75(2), pp. 354-364. doi:10.1016/0377-2217(94)90080-9

    [publisher’s website]

  39. Glass, C.A., Gupta, J.N.D. and Potts, C.N. (1994). Lot streaming in three-stage production processes. European Journal of Operational Research, 75(2), pp. 378-394. doi:10.1016/0377-2217(94)90082-5

    [publisher’s website]

  40. Glass, C.A. (1992). Feasibility of Scheduling Lot Sizes of Three Products on One Machine. Management Science, 38(10), pp. 1482-1494

    [publisher’s website]

Report

  1. Glass, C., Callaghan, S.A., Agnew, J.L., Bacon, D., Davies, I. and Wales, S.W. (2006). Improving Spectral Efficiency of Fixed Link Services. CCLRC Rutherford Appleton Laboratory Radio Communications Research Unit, Cass Business School and Roke Manor Research Ltd.

Working paper

Professional activities

Collaboration (industrial)

  1. Improving Spectral Efficiency of Fixed Link Services project (September 2005 - June 2006)
    Sponsored by OfCom
    Other partners: Rutherford Appleton Laboratory and Roke Manor Research Ltd.

Consultancy (3)

  1. Whittington Hospital (Public Sector) (September 2015 - present)
    The consultancy has provided advice on staff deployment to meet patient demand, and actual rosters for doctors which reduce their fatigue. The aims extended to testing out the extent to which annual and study leave requests could also be simultaneously met. This is the first phase of providing roster software as a service (SaaS) for the NHS.
  2. OfCom (Public Sector) (December 2011 - September 2012)
    The project for OfCom was to provide advice on 'Improving spectral efficiency for fixed links' radio spectrum'. We developed optimisation algorithms to allocation of radio spectrum to users, which could also inform the later public sale of radio spectrum.
  3. Registered Nursing Homes Association (Private Sector) (April 2011 - August 2014)
    Development of a rostering system for staff in Nursing and Care Homes. The work involves close collaboration with Care Home managers to elicit their requirements, and combining this with a smart user interface.

Editorial activity (5)

  1. Operations Research for Health Care, Referee, 2012 - present.
  2. European Journal of Operational Research, Referee, 2006 - present.
  3. Journal of Production Research, Referee, 2004 - present.
  4. Computing and Operations Research, Referee, 2002 - present.
  5. Operations Research, Referee, 1999 - 2010.

Events/conferences (25)

  1. IFORS and EURO 2014. (Conference) Balcelona, Spain (2014). Invited speaker.
    Paper: Scheduling Wireless Networks: the Advantages of Co-operation
    Author: Glass C. A.
  2. EUROxxvi. (Conference) Rome (2013). Invited speaker.
    Paper: Call Centre Routing Rules
    Author: Glass C. A.
  3. LANCS Healthcare custer workshop - Planning and Scheduling Applications of Operational Research in Healthcare, (Conference) Nottingham University 01/2010 (2012). Chair and Organising Committee
  4. EUROxxv. (Conference) Lithuania (2012). Invited speaker.
    Paper: Periodic Scheduling for Wireless Access Networks to the Internet
    Author: Glass C. A.
  5. IFORS 2011. (Conference) Sydney, Australia (2011). Invited speaker.
    Paper: Scheduling Wireless Mesh Networks: a periodic approach
    Author: Glass C. A.
  6. London Combinatorial Seminar Series, Queen Mary London. (Seminar) Mathematics Department, Queen Mary London University (2010). Invited speaker.
    Paper: Minimizing the Number of Gap-Zeros in Binary Matrices
    Author: Glass C. A.
  7. LANCS Healthcare custer workshop - Planning and Scheduling Applications of Operational Research in Healthcare. Nottingham, UK (2010).
    Paper: Nurse and doctor ristering: what is a good roster?
    Author: Glass C. A.
  8. EURO xxiv. (Conference) Lisbon, Portugal (2010). Invited speaker.
    Paper: Periodic Scheduling for Wireless Mesh Networks
    Author: Glass C. A.
  9. MISTA. (Conference) Dublin, Ireland (2009). Invited speaker.
    Paper: Scheduling in a micro-biological laboratory: heuristics for sequencing food sample tests, to co-ordinate with production of perishable media materials
    Author: Glass C. A.
    Co-authors: K. Chakhlevitch
  10. EURO xxiii. (Conference) (2009).
    Paper: Rosters versas rotas for NHS nurses and doctors (in the UK)
    Author: Glass C. A.
  11. Network Group seminar series, Queen Mary's College. (Seminar) London/UK (2008). Invited speaker.
    Paper: Routing and Wavelength Assignment of a pure-optical network: an Optimality Gap.
    Author: Glass C. A.
  12. New Challenges in Scheduling Theory. (Workshop) Marseille/France (2008). Invited speaker.
    Paper: Scheduling in telecommunication applications: the optimality gap
    Author: Glass C. A.
  13. Combinatorics: when mathematics meets engineering. (Workshop) Queen Mary, London University, UK (2008). Invited speaker.
    Paper: Keynote talk: Mathematicians working with Engineers, an Optimality Gap
    Author: Glass C. A.
  14. SIAM UK/IE annual meeting. (Conference) Southampton/UK (2008). Invited speaker.
    Paper: Discrete algorithms for industrial applications: bottlenecks in call centres and micro-biology laboratories
    Author: Glass C. A.
  15. OR50, annual conference of the Operational Research Society. (Conference) York, UK (2008). Invited speaker.
    Paper: Call centre tour scheduling with employee preferences
    Author: Glass C.A.
    Co-authors: R. A. Knight
  16. International Symposium on Combinatorial Optimization. (Conference) Warwick/UK (2008). Invited speaker.
    Paper: Scheduling on parallel machines, with perishability time windows, inspired by the process of micro-biology food testing.
    Author: Glass C. A.
    Co-authors: K. Chakhlevitch
  17. EUROxxi. (Conference) Reykjavik/Iceland (2006). Invited speaker.
    Paper: Combinatorial Optimisation for Frequency Assignment
    Author: Glass C. A.
  18. Simluation and scheduling. (Workshop) Schloss Dagstuhl, Computing research centre (2005). Invited speaker.
    Paper: Advantages of discrete scheduling
    Author: Glass C. A.
  19. MISTA 2005. (Conference) New York, US (2005). Invited speaker.
    Paper: How to maximize rewards in an incetivised made-to-order scheduling environment
    Author: Glass C. A.
  20. Combinatorial Optimisation (CO) 2004. Lancaster UK. (2004).
    Paper: Structural properties of the Frequency Assignment Problem.
  21. EURO/INFORMS2003. Istanbul, Turkey (2003).
    Paper: Dynamic Programming for optimal insurance premium pricing
  22. Operational Resaerch Society Workshop on Local Search. City University (2002).
    Paper: Co-organiser and co-editor of procedings
  23. North West OR Society group and Lancaster University. Lancaster Managment School (2001).
    Paper: How rationalising packing led to allocating bandwidth
  24. (Seminar) EPFL, Lausanne, Switzerland (1998).
    Paper: New Approach to Graph Colouring
  25. 16th International Symposium on Mathematical Programming. Lausanne, Switzerland (1998).
    Paper: Scheduling with batching