default search action
Jason A. D. Atkin
Person information
- affiliation: University of Nottingham, School of Computer Science, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j26]Salman Arif
, Jason A. D. Atkin, Geert De Maere:
Analysing the benefits of trajectory deviations for planar trajectory optimisation. Ann. Oper. Res. 326(1): 537-560 (2023) - [j25]Düriye Betül Gümüs, Ender Özcan, Jason A. D. Atkin, John H. Drake:
An investigation of F-Race training strategies for cross domain optimisation with memetic algorithms. Inf. Sci. 619: 153-171 (2023) - 2020
- [j24]Luiz Jonatã Pires de Araújo, Ajit Panesar, Ender Özcan
An experimental analysis of deepest bottom-left-fill packing methods for additive manufacturing. Int. J. Prod. Res. 58(22): 6917-6933 (2020) - [j23]Christopher Bayliss
Scheduling airline reserve crew using a probabilistic crew absence and recovery model. J. Oper. Res. Soc. 71(4): 543-565 (2020)
2010 – 2019
- 2019
- [j22]Luiz J. P. Araújo, Ender Özcan
Analysis of irregular three-dimensional packing problems in additive manufacturing: a new taxonomy and dataset. Int. J. Prod. Res. 57(18): 5920-5934 (2019) - [j21]Jason A. D. Atkin, Han Hoogeveen, Raik Stolletz
Airport operations management. OR Spectr. 41(3): 613-614 (2019) - [c16]Xin Wang, Jason A. D. Atkin, Serhiy Bozhko, Christopher Ian Hill:
Optimal Power Flow Based Architecture Design for Electrical Power System in More-Electric Aircraft. IECON 2019: 5814-5819 - [c15]Jérémie Clos, Rong Qu, Jason A. D. Atkin:
Information Retrieval for Evidence-Based Policy Making Applied to Lifelong Learning. SGAI Conf. 2019: 487-493 - 2018
- [j20]Siavash H. Khajavi
To kit or not to kit: Analysing the value of model-based kitting for additive manufacturing. Comput. Ind. 98: 100-117 (2018) - [j19]Elizabeth M. Argyle
Human performance and strategies while solving an aircraft routing and sequencing problem: an experimental approach. Cogn. Technol. Work. 20(3): 425-441 (2018) - [j18]Geert De Maere
Pruning Rules for Optimal Runway Sequencing. Transp. Sci. 52(4): 898-916 (2018) - 2017
- [j17]Christopher Bayliss
A simulation scenario based mixed integer programming approach to airline reserve crew scheduling under uncertainty. Ann. Oper. Res. 252(2): 335-363 (2017) - [j16]Daniel Karapetyan
Lessons from building an automated pre-departure sequencer for airports. Ann. Oper. Res. 252(2): 435-453 (2017) - [j15]Xiaoping Jiang, Ruibin Bai
A scheme for determining vehicle routes based on Arc-based service network design. INFOR Inf. Syst. Oper. Res. 55(1): 16-37 (2017) - 2016
- [j14]Jun Chen
Toward a More Realistic, Cost-Effective, and Greener Ground Movement Through Active Routing: A Multiobjective Shortest Path Approach. IEEE Trans. Intell. Transp. Syst. 17(12): 3524-3540 (2016) - [c14]Düriye Betül Gümüs, Ender Özcan
An investigation of tuning a memetic algorithm for cross-domain search. CEC 2016: 135-142 - [c13]Yan Jin, Rong Qu, Jason A. D. Atkin:
Constrained Portfolio Optimisation: The State-of-the-Art Markowitz Models. ICORES 2016: 388-395 - [c12]Düriye Betül Gümüs, Ender Özcan
An Analysis of the Taguchi Method for Tuning a Memetic Algorithm with Reduced Computational Time Budget. ISCIS 2016: 12-20 - [c11]S. Paternostro, Terry Moore
Evaluation of advanced receiver autonomous integrity monitoring performance on predicted aircraft trajectories. PLANS 2016: 842-856 - 2015
- [c10]Rodrigo Lankaites Pinheiro, Dario Landa Silva
Analysis of Objectives Relationships in Multiobjective Problems Using Trade-Off Region Maps. GECCO 2015: 735-742 - [c9]Rodrigo Lankaites Pinheiro, Dario Landa-Silva
A Variable Neighbourhood Search for the Workforce Scheduling and Routing Problem. NaBIC 2015: 247-259 - 2014
- [j13]Stefan Ravizza, Jun Chen
Aircraft taxi time prediction: Comparisons and insights. Appl. Soft Comput. 14: 397-406 (2014) - [j12]Ruibin Bai
A novel approach to independent taxi scheduling problem based on stable matching. J. Oper. Res. Soc. 65(10): 1501-1510 (2014) - [j11]Stefan Ravizza, Jason A. D. Atkin, Edmund K. Burke
A more realistic approach for airport ground movement optimisation with stand holding. J. Sched. 17(5): 507-520 (2014) - [j10]Amadeo Ascó Signes
An analysis of constructive algorithms for the airport baggage sorting station assignment problem. J. Sched. 17(6): 601-619 (2014) - [c8]Michal Weiszer, Jun Chen, Stefan Ravizza, Jason A. D. Atkin, Paul J. Stewart:
A heuristic approach to greener airport ground movement. IEEE Congress on Evolutionary Computation 2014: 3280-3286 - [c7]Yan Jin
A Population-Based Incremental Learning Method for Constrained Portfolio Optimisation. SYNASC 2014: 212-219 - [c6]Edward Kent, Jason A. D. Atkin, Rong Qu:
Vehicle Routing in a Forestry Commissioning Operation Using Ant Colony Optimisation. TPNC 2014: 95-106 - 2013
- [j9]Stefan Ravizza, Jason A. D. Atkin, Marloes H. Maathuis
A combined statistical approach and ground movement model for improving taxi time estimations at airports. J. Oper. Res. Soc. 64(9): 1347-1360 (2013) - [j8]Stefan Ravizza, Jun Chen
The trade-off between taxi time and fuel consumption in airport ground movement. Public Transp. 5(1-2): 25-40 (2013) - [j7]Jason A. D. Atkin, Geert De Maere
Addressing the Pushback Time Allocation Problem at Heathrow Airport. Transp. Sci. 47(4): 584-602 (2013) - [c5]Urszula M. Neuman, Jason A. D. Atkin:
Airport Gate Assignment Considering Ground Movement. ICCL 2013: 184-198 - [c4]Christopher Bayliss
Scheduling Airline Reserve Crew to Minimise Crew Related Delay Using Simulated Airline Recovery and a Probabilistic Optimisation Model. SMC 2013: 1944-1950 - [p1]Jason A. D. Atkin:
Airport Airside Optimisation Problems. Automated Scheduling and Planning 2013: 1-37 - 2012
- [j6]Ruibin Bai
Tabu assisted guided local search approaches for freight service network design. Inf. Sci. 189: 266-281 (2012) - [c3]Christopher Bayliss
Probabilistic Airline Reserve Crew Scheduling Model. ATMOS 2012: 132-143 - [c2]Amadeo Ascó Signes, Jason A. D. Atkin, Edmund K. Burke
An Evolutionary Algorithm for the Over-constrained Airport Baggage Sorting Station Assignment Problem. SEAL 2012: 32-41 - 2011
- [j5]Jason A. D. Atkin, Edmund K. Burke
A comparison of two methods for reducing take-off delay at London Heathrow airport. J. Sched. 14(5): 409-421 (2011) - [c1]Jun Chen, Stefan Ravizza, Jason A. D. Atkin, Paul J. Stewart:
On the Utilisation of Fuzzy Rule-Based Systems for Taxi Time Estimations at Airports. ATMOS 2011: 134-145 - 2010
- [j4]Jason A. D. Atkin, Edmund K. Burke
TSAT allocation at London Heathrow: the relationship between slot compliance, throughput and equity. Public Transp. 2(3): 173-198 (2010)
2000 – 2009
- 2009
- [j3]Jason A. D. Atkin, Edmund K. Burke
An examination of take-off scheduling constraints at London Heathrow airport. Public Transp. 1(3): 169 (2009) - 2008
- [b1]Jason Adam David Atkin:
On-line decision support for take-off runaway scheduling at London Heathrow Airport. University of Nottingham, UK, 2008 - [j2]Jason A. D. Atkin, Edmund K. Burke
On-line decision support for take-off runway scheduling with uncertain taxi times at London Heathrow airport. J. Sched. 11(5): 323-346 (2008) - 2007
- [j1]Jason A. D. Atkin, Edmund K. Burke
Hybrid Metaheuristics to Aid Runway Scheduling at London Heathrow Airport. Transp. Sci. 41(1): 90-106 (2007)
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-08-15 23:39 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: