default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew Wirth
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c4]Sijia Liu, Patrick Lange, Behnam Hedayatnia, Alexandros Papangelis, Di Jin, Andrew Wirth, Yang Liu, Dilek Hakkani-Tur:
Towards Credible Human Evaluation of Open-Domain Dialog Systems Using Interactive Setup. AAAI 2023: 13264-13272
2010 – 2019
- 2018
- [j24]Khalid Abdulla
, Julian de Hoog, Valentin Müenzel, Frank Suits, Kent Charles Barton Steer, Andrew Wirth, Saman K. Halgamuge:
Optimal Operation of Energy Storage Systems Considering Forecasts and Battery Degradation. IEEE Trans. Smart Grid 9(3): 2086-2096 (2018) - 2016
- [j23]Lele Zhang, Andrew Wirth:
Online Machine Scheduling with Family Setups. Asia Pac. J. Oper. Res. 33(4): 1650027:1-1650027:16 (2016) - [c3]Khalid Abdulla, Kent C. B. Steer, Andrew Wirth, Julian de Hoog, Saman K. Halgamuge:
Integrating Data-Driven Forecasting and Optimization to Improve the Operation of Distributed Energy Storage. HPCC/SmartCity/DSS 2016: 1365-1372 - 2013
- [j22]Amir H. Abdekhodaee, Andrew Wirth:
Off-line scheduling with forbidden zones. Comput. Oper. Res. 40(4): 1034-1037 (2013) - 2012
- [j21]Lele Zhang, Andrew Wirth:
On-Line Scheduling of Empty Containers. Asia Pac. J. Oper. Res. 29(4) (2012) - [j20]Heng-Soon Gan, Andrew Wirth, Amir H. Abdekhodaee:
A branch-and-price algorithm for the general case of scheduling parallel machines with a single server. Comput. Oper. Res. 39(9): 2242-2247 (2012) - 2011
- [j19]Amit Chakrabarti, Venkatesan Guruswami, Andrew Wirth, Anthony Wirth:
The query complexity of estimating weighted averages. Acta Informatica 48(7-8): 417-426 (2011) - 2010
- [j18]Lele Zhang, Andrew Wirth:
On-line machine scheduling with batch setups. J. Comb. Optim. 20(3): 285-306 (2010) - [j17]Lele Zhang, Andrew Wirth:
Wind energy management with battery storage. J. Oper. Res. Soc. 61(10): 1510-1522 (2010)
2000 – 2009
- 2009
- [j16]Lele Zhang, Andrew Wirth:
On-line scheduling of two parallel machines with a single server. Comput. Oper. Res. 36(5): 1529-1553 (2009) - [p1]Kent C. B. Steer, Andrew Wirth, Saman K. Halgamuge:
The Rationale Behind Seeking Inspiration from Nature. Nature-Inspired Algorithms for Optimisation 2009: 51-76 - 2008
- [j15]Lele Zhang, Kwanniti Khammuang, Andrew Wirth:
On-line scheduling with non-crossing constraints. Oper. Res. Lett. 36(5): 579-583 (2008) - [c2]Kent C. B. Steer, Andrew Wirth, Saman K. Halgamuge:
Information Theoretic Classification of Problems for Metaheuristics. SEAL 2008: 319-328 - 2007
- [j14]Heng-Soon Gan, Andrew Wirth:
Heuristic stability: A permutation disarray measure. Comput. Oper. Res. 34(11): 3187-3208 (2007) - [j13]Kwanniti Khammuang, Amir H. Abdekhodaee, Andrew Wirth:
On-line scheduling with forbidden zones. J. Oper. Res. Soc. 58(1): 80-90 (2007) - 2006
- [j12]Amir H. Abdekhodaee, Andrew Wirth, Heng-Soon Gan:
Scheduling two parallel machines with a single server: the general case. Comput. Oper. Res. 33: 994-1009 (2006) - 2005
- [j11]Simon Dunstall, Andrew Wirth:
Heuristic methods for the identical parallel machine flowtime problem with set-up times. Comput. Oper. Res. 32: 2479-2491 (2005) - [j10]Simon Dunstall, Andrew Wirth:
A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines. Eur. J. Oper. Res. 167(2): 283-296 (2005) - 2004
- [j9]Rasika H. Suriyaarachchi, Andrew Wirth:
Earliness/tardiness scheduling with a common due date and family setups. Comput. Ind. Eng. 47(2-3): 275-288 (2004) - [j8]Amir H. Abdekhodaee, Andrew Wirth, Heng-Soon Gan:
Equal processing and equal setup time cases of scheduling parallel machines with a single server. Comput. Oper. Res. 31(11): 1867-1889 (2004) - 2003
- [j7]Iradj Ouveysi, Andrew Wirth, Annie Yeh, Osman Oguz:
Large Scale Linear Programs and Heuristics for the Design of Survivable Telecommunication Networks. Ann. Oper. Res. 124(1-4): 285-293 (2003) - 2002
- [j6]Amir H. Abdekhodaee, Andrew Wirth:
Scheduling parallel machines with a single server: some solvable cases and heuristics. Comput. Oper. Res. 29(3): 295-315 (2002) - 2000
- [j5]Iradj Ouveysi, Farzad Safaei, Andrew Wirth:
Planning of Transport Networks based on Photonic and Electronic Cross-Connection. Photonic Netw. Commun. 2(2): 199-208 (2000)
1990 – 1999
- 1999
- [j4]Iradj Ouveysi, Andrew Wirth:
On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic. Eur. J. Oper. Res. 117(1): 30-44 (1999) - [j3]Rodney P. Parker, Andrew Wirth:
Manufacturing flexibility: Measures and relationships. Eur. J. Oper. Res. 118(3): 429-449 (1999) - [j2]Iradj Ouveysi, Andrew Wirth:
Fast heuristics for protection networks for dynamic routing. J. Oper. Res. Soc. 50(3): 262-267 (1999) - 1998
- [c1]Iradj Ouveysi, Farzad Safaei, Andrew Wirth:
Dimensioning and dynamic reconfiguration of hierarchical multi-service crossconnect platforms for multihour traffic profiles. ICC 1998: 249-252 - 1991
- [j1]Jim McGovern, Danny Samson, Andrew Wirth:
Knowledge acquisition for intelligent decision systems. Decis. Support Syst. 7(3): 263-272 (1991)
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-12-18 18:29 CET 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:
