default search action
Alan J. Soper
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j13]Alan J. Soper, Vitaly A. Strusevich
:
Preemptive and non-preemptive scheduling on two unrelated parallel machines. J. Sched. 25(6): 659-674 (2022) - 2021
- [j12]Alan J. Soper, Vitaly A. Strusevich:
Parametric analysis of the quality of single preemption schedules on three uniform parallel machines. Ann. Oper. Res. 298(1): 469-495 (2021) - 2020
- [j11]Alan J. Soper
Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects. J. Sched. 23(6): 665-680 (2020)
2010 – 2019
- 2019
- [j10]Alan J. Soper, Vitaly A. Strusevich
Schedules with a single preemption on uniform parallel machines. Discret. Appl. Math. 261: 332-343 (2019) - 2017
- [j9]Leah Epstein, Asaf Levin
Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines. SIAM J. Discret. Math. 31(1): 101-123 (2017) - 2015
- [j8]Alan J. Soper:
A cyclical search for the two machine flow shop and open shop to minimise finishing time. J. Sched. 18(3): 311-314 (2015) - 2014
- [j7]Alan J. Soper, Vitaly A. Strusevich:
Single parameter analysis of power of preemption on two and three uniform machines. Discret. Optim. 12: 26-46 (2014) - [c7]Alan J. Soper, Vitaly A. Strusevich:
Power of Preemption on Uniform Parallel Machines. APPROX-RANDOM 2014: 392-402 - 2013
- [j6]Hans Kellerer, Alan J. Soper, Vitaly A. Strusevich:
Preemptive scheduling on two identical parallel machines with a single transporter. J. Comb. Optim. 25(2): 279-307 (2013) - 2012
- [c6]Carl Crawford, Chris Walshaw
A Multilevel Force-directed Graph Drawing Algorithm Using Multilevel Global Force Approximation. IV 2012: 454-459 - 2010
- [c5]Hans Kellerer, Alan J. Soper, Vitaly A. Strusevich:
Transporting Jobs through a Processing Center with Two Parallel Machines. COCOA (1) 2010: 408-422
2000 – 2009
- 2008
- [c4]Demane Rodney, Alan J. Soper, Chris Walshaw:
Multilevel Approaches applied to the Capacitated Clustering Problem. CSC 2008: 271-277 - 2007
- [j5]Alan J. Soper, Vitaly A. Strusevich:
An Improved Approximation Algorithm for the Two-Machine Flow Shop Scheduling Problem with an interstage transporter. Int. J. Found. Comput. Sci. 18(3): 565-591 (2007) - [c3]Demane Rodney, Alan J. Soper, Chris Walshaw
The application of Multilevel Refinement to the Vehicle Routing Problem. CISched 2007: 212-219 - 2004
- [j4]Alan J. Soper, Chris Walshaw
A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-Partitioning. J. Glob. Optim. 29(2): 225-241 (2004) - 2000
- [c2]Alan J. Soper, Chris Walshaw, Mark Cross:
A Combined Evolutionary Search and Multilevel Approach to Graph Partitioning. GECCO 2000: 674-681
1990 – 1999
- 1998
- [j3]Jun Zhao, Brian Knight, Ephraim Nissan, Alan J. Soper:
FuelGen: Effective Evolutionary Design of Refuellings for Pressurized Water Reactors. Comput. Artif. Intell. 17(2-3): 105-125 (1998) - [j2]Alan J. Soper:
A higher order Hopfield network for vector quantisation. Neural Comput. Appl. 7(2): 99-106 (1998) - 1997
- [c1]Alan J. Soper, P. F. Robbins:
A Redundant Representation for use by Genetic Algorithms on Parameter Optimisation Problems. ICANNGA 1997: 202-205 - 1995
- [j1]Jun Zhao, Garrett Donough Anthony Kearney, Alan J. Soper:
Classifying Expressions by Cascade-Correlation Neural Network. Neural Comput. Appl. 3(2): 113-124 (1995)
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-05-08 21:01 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: