C
Celia A. Glass
Researcher at City University London
Publications - 32
Citations - 1079
Celia A. Glass is an academic researcher from City University London. The author has contributed to research in topics: Scheduling (computing) & Job shop scheduling. The author has an hindex of 19, co-authored 32 publications receiving 1036 citations. Previous affiliations of Celia A. Glass include University of Southampton & University of London.
Papers
More filters
Journal ArticleDOI
The scheduling of maintenance service
TL;DR: This paper proposes a greedy algorithm and provides a heuristic, based on regular cycles for all but one activity type, with a guaranteed worse case bound, and investigates properties of an optimal solution and shows that there is always a cyclic optimal policy.
Journal ArticleDOI
Unrelated parallel machine scheduling using local search
TL;DR: These techniques are applied to the problem of scheduling jobs on unrelated parallel machines to minimize the maximum completion time and a hybrid method in which descent is incorporated into the genetic algorithm is comparable in performance with simulated annealing and taboo search.
Journal ArticleDOI
The nurse rostering problem: A critical appraisal of the problem structure
Celia A. Glass,Roger A. Knight +1 more
TL;DR: This paper analyzes a class of four benchmark instances from the nurse rostering literature to provide insight into the nature of the problem and provides a methodology for handling roStering constraints and preferences arising from the continuity from one scheduling period to the next.
Journal ArticleDOI
Lot streaming in three-stage production processes
TL;DR: This paper develops algorithms to minimize the makespan for a single job in three-stage production processes and proposes an algorithm which computes the minimum makespan in O(log s) time.
Journal ArticleDOI
Parallel machine scheduling with job assignment restrictions
Celia A. Glass,Hans Kellerer +1 more
TL;DR: An algorithm is contributed that provides a 3/2 worst case bound and runs in time linear in the number of jobs for assignment restrictions determined by just one characteristic of the machines.