default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCelia A. Glass
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j22]Eun-Seok Kim, Celia A. Glass
:
Perfect periodic scheduling for binary tree routing in wireless networks. Eur. J. Oper. Res. 247(2): 389-400 (2015)- 2014
- [j21]Eun-Seok Kim, Celia A. Glass:
Perfect periodic scheduling for three basic cycles. J. Sched. 17(1): 47-65 (2014) - 2013
- [j20]Konstantin Chakhlevitch, Celia A. Glass, Natalia V. Shakhlevich:
Minimising the number of gap-zeros in binary matrices. Eur. J. Oper. Res. 229(1): 48-58 (2013) - 2011
- [j19]Konstantin Chakhlevitch, Celia A. Glass, Hans Kellerer:
Batch machine production with perishability time windows and limited batch size. Eur. J. Oper. Res. 210(1): 39-47 (2011) - 2010
- [j18]Celia A. Glass, Jeroen M. van Oostrum:
Bun splitting: a practical cutting stock problem. Ann. Oper. Res. 179(1): 15-33 (2010) - [j17]Celia A. Glass, Roger A. Knight:
The nurse rostering problem: A critical appraisal of the problem structure. Eur. J. Oper. Res. 202(2): 379-389 (2010)
2000 – 2009
- 2009
- [j16]Konstantin Chakhlevitch, Celia A. Glass:
Scheduling reentrant jobs on parallel machines with a remote server. Comput. Oper. Res. 36(9): 2580-2589 (2009) - [j15]Celia A. Glass, Christopher Phillips, Song Dong:
Layered connection management for dynamic all-optical networks. IET Commun. 3(9): 1520-1532 (2009) - 2006
- [j14]Celia A. Glass, H. R. Mills:
Scheduling unit length jobs with parallel nested machine processing set restrictions. Comput. Oper. Res. 33: 620-638 (2006) - 2005
- [j13]Celia A. Glass, Adam Prügel-Bennett:
A polynomially searchable exponential neighbourhood for graph colouring. J. Oper. Res. Soc. 56(3): 324-330 (2005) - 2004
- [j12]Celia A. Glass, Chris N. Potts, A. L. Tuson:
Editorial. J. Oper. Res. Soc. 55(7): 685-686 (2004) - 2003
- [j11]Celia A. Glass, Adam Prügel-Bennett:
Genetic Algorithm for Graph Coloring: Exploration of Galinier and Hao's Algorithm. J. Comb. Optim. 7(3): 229-236 (2003) - 2002
- [j10]Celia A. Glass:
Bag rationalisation for a food manufacturer. J. Oper. Res. Soc. 53(5): 544-551 (2002) - 2001
- [j9]Celia A. Glass, Chris N. Potts, Vitaly A. Strusevich:
Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops. INFORMS J. Comput. 13(2): 120-137 (2001) - 2000
- [j8]Alex E. Gerodimos, Celia A. Glass, Chris N. Potts:
Scheduling the production of two-component jobs on a single machine. Eur. J. Oper. Res. 120(2): 250-259 (2000)
1990 – 1999
- 1999
- [j7]Shoshana Anily, Celia A. Glass, Refael Hassin:
Scheduling maintenance services to three machines. Ann. Oper. Res. 86: 375-391 (1999) - [j6]Alex E. Gerodimos, Celia A. Glass, Chris N. Potts, Thomas Tautenhahn:
Scheduling multi‐operation jobs on a single machine. Ann. Oper. Res. 92: 87-105 (1999) - [j5]Celia A. Glass, Jatinder N. D. Gupta, Chris N. Potts:
Two-Machine No-Wait Flow Shop Scheduling with Missing Operations. Math. Oper. Res. 24(4): 911-924 (1999) - 1998
- [j4]Shoshana Anily, Celia A. Glass, Refael Hassin:
The Scheduling of Maintenance Service. Discret. Appl. Math. 82(1-3): 27-42 (1998) - [j3]Celia A. Glass, Chris N. Potts:
Structural Properties of Lot Streaming in a Flow Shop. Math. Oper. Res. 23(3): 624-639 (1998) - 1996
- [j2]Celia A. Glass, Chris N. Potts:
A comparison of local search methods for flow shop scheduling. Ann. Oper. Res. 63(4): 489-509 (1996) - [j1]Bo Chen, Celia A. Glass, Chris N. Potts, Vitaly A. Strusevich:
A New Heuristic for Three-Machine Flow Shop Scheduling. Oper. Res. 44(6): 891-898 (1996) - 1993
- [c1]Rachel Harrison, Celia A. Glass:
Dynamic Programming in a Pure Functional Language. SAC 1993: 179-186
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
