IDEAS home Printed from https://ideas.repec.org/f/pbe674.html
   My authors  Follow this author

John Beasley

Personal Details

First Name:John
Middle Name:E
Last Name:Beasley
Suffix:
RePEc Short-ID:pbe674
[This author has chosen not to make the email address public]
http://people.brunel.ac.uk/~mastjjb/jeb/jeb.html

Affiliation

Brunel University

http://www.brunel.ac.uk
Uxbridge, UK

Research output

as
Jump to: Working papers Articles

Working papers

  1. Cristiano Arbex Valle & John E Beasley & Nigel Meade, 2024. "Subset second-order stochastic dominance for enhanced indexation with diversification enforced by sector constraints," Papers 2404.16777, arXiv.org, revised Nov 2024.
  2. C. A. Valle & J. E. Beasley, 2019. "A nonlinear optimisation model for constructing minimal drawdown portfolios," Papers 1908.08684, arXiv.org.
  3. N. Meade & J. E. Beasley & C. J. Adcock, 2019. "Quantitative portfolio selection: using density forecasting to find consistent portfolios," Papers 1908.08442, arXiv.org, revised Jun 2020.

Articles

  1. Meade, N. & Beasley, J.E. & Adcock, C.J., 2021. "Quantitative portfolio selection: Using density forecasting to find consistent portfolios," European Journal of Operational Research, Elsevier, vol. 288(3), pages 1053-1067.
  2. Arbex Valle, Cristiano & Beasley, John E, 2020. "Order batching using an approximation for the distance travelled by pickers," European Journal of Operational Research, Elsevier, vol. 284(2), pages 460-484.
  3. Valle, Cristiano Arbex & Beasley, John E. & da Cunha, Alexandre Salles, 2017. "Optimally solving the joint order batching and picker routing problem," European Journal of Operational Research, Elsevier, vol. 262(3), pages 817-834.
  4. López, C.O. & Beasley, J.E., 2016. "A formulation space search heuristic for packing unequal circles in a fixed size circular container," European Journal of Operational Research, Elsevier, vol. 251(1), pages 64-73.
  5. Valle, C.A. & Meade, N. & Beasley, J.E., 2014. "Absolute return portfolios," Omega, Elsevier, vol. 45(C), pages 20-41.
  6. H Mezali & J E Beasley, 2013. "Quantile regression for index tracking and enhanced indexation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(11), pages 1676-1692, November.
  7. Woodside-Oriakhi, M. & Lucas, C. & Beasley, J.E., 2013. "Portfolio rebalancing with an investment horizon and transaction costs," Omega, Elsevier, vol. 41(2), pages 406-420.
  8. Anken, F. & Beasley, J.E., 2012. "Corporate structure optimisation for multinational companies," Omega, Elsevier, vol. 40(2), pages 230-243, April.
  9. N. Meade & J. E. Beasley, 2011. "Detection of momentum effects using an index out-performance strategy," Quantitative Finance, Taylor & Francis Journals, vol. 11(2), pages 313-326.
  10. G Mitchell & J E Beasley, 2011. "Optimisation of sludge treatment and transport," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(6), pages 939-948, June.
  11. López, C.O. & Beasley, J.E., 2011. "A heuristic for the circle packing problem with a variety of containers," European Journal of Operational Research, Elsevier, vol. 214(3), pages 512-525, November.
  12. Woodside-Oriakhi, M. & Lucas, C. & Beasley, J.E., 2011. "Heuristic algorithms for the cardinality constrained efficient frontier," European Journal of Operational Research, Elsevier, vol. 213(3), pages 538-550, September.
  13. Poojari, C.A. & Beasley, J.E., 2009. "Improving benders decomposition using a genetic algorithm," European Journal of Operational Research, Elsevier, vol. 199(1), pages 89-97, November.
  14. Canakgoz, N.A. & Beasley, J.E., 2009. "Mixed-integer programming approaches for index tracking and enhanced indexation," European Journal of Operational Research, Elsevier, vol. 196(1), pages 384-399, July.
  15. F Alonso & M J Alvarez & J E Beasley, 2008. "A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(7), pages 963-976, July.
  16. L Vogt & C A Poojari & J E Beasley, 2007. "A tabu search algorithm for the single vehicle routing allocation problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(4), pages 467-480, April.
  17. Pinol, H. & Beasley, J.E., 2006. "Scatter Search and Bionomic Algorithms for the aircraft landing problem," European Journal of Operational Research, Elsevier, vol. 171(2), pages 439-462, June.
  18. Beasley, J. E., 2004. "A population heuristic for constrained two-dimensional non-guillotine cutting," European Journal of Operational Research, Elsevier, vol. 156(3), pages 601-627, August.
  19. J E Beasley & M Krishnamoorthy & Y M Sharaiha & D Abramson, 2004. "Displacement problem and dynamically scheduling aircraft landings," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(1), pages 54-64, January.
  20. Beasley, J. E. & Meade, N. & Chang, T. -J., 2003. "An evolutionary heuristic for the index tracking problem," European Journal of Operational Research, Elsevier, vol. 148(3), pages 621-643, August.
  21. Beasley, J. E., 2003. "Allocating fixed costs and resources via data envelopment analysis," European Journal of Operational Research, Elsevier, vol. 147(1), pages 198-216, May.
  22. J E Beasley & H Howells & J Sonander, 2002. "Improving short-term conflict alert via tabu search," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(6), pages 593-602, June.
  23. N P Hoare & J E Beasley, 2001. "Placing boxes on shelves: a case study," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(6), pages 605-614, June.
  24. J E Beasley & J Sonander & P Havelock, 2001. "Scheduling aircraft landings at London Heathrow using a population heuristic," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(5), pages 483-493, May.
  25. J. E. Beasley & M. Krishnamoorthy & Y. M. Sharaiha & D. Abramson, 2000. "Scheduling Aircraft Landings—The Static Case," Transportation Science, INFORMS, vol. 34(2), pages 180-197, May.
  26. Y.M. Sharaiha & J.E. Beasley, 1999. "Foreword," Annals of Operations Research, Springer, vol. 86(0), pages 0, January.
  27. Beasley, J. E. & Christofides, N., 1997. "Vehicle routing with a sparse feasibility graph," European Journal of Operational Research, Elsevier, vol. 98(3), pages 499-511, May.
  28. Beasley, J. E. & Cao, B., 1996. "A tree search algorithm for the crew scheduling problem," European Journal of Operational Research, Elsevier, vol. 94(3), pages 517-526, November.
  29. J. Beasley & E. Nascimento, 1996. "The Vehicle Routing-Allocation Problem: A unifying framework," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 4(1), pages 65-86, June.
  30. Beasley, J. E. & Chu, P. C., 1996. "A genetic algorithm for the set covering problem," European Journal of Operational Research, Elsevier, vol. 94(2), pages 392-404, October.
  31. Beasley, J. E., 1993. "Lagrangean heuristics for location problems," European Journal of Operational Research, Elsevier, vol. 65(3), pages 383-399, March.
  32. Beasley, J. E. & Jornsten, K., 1992. "Enhancing an algorithm for set covering problems," European Journal of Operational Research, Elsevier, vol. 58(2), pages 293-300, April.
  33. Beasley, J. E., 1992. "A heuristic for Euclidean and rectilinear Steiner problems," European Journal of Operational Research, Elsevier, vol. 58(2), pages 284-292, April.
  34. J. E. Beasley, 1990. "A lagrangian heuristic for set‐covering problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(1), pages 151-164, February.
  35. Beasley, J. E., 1990. "Comparing university departments," Omega, Elsevier, vol. 18(2), pages 171-183.
  36. Beasley, J. E., 1988. "An algorithm for solving large capacitated warehouse location problems," European Journal of Operational Research, Elsevier, vol. 33(3), pages 314-325, February.
  37. Beasley, J. E., 1987. "An algorithm for set covering problem," European Journal of Operational Research, Elsevier, vol. 31(1), pages 85-93, July.
  38. J. E. Beasley, 1985. "An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure," Operations Research, INFORMS, vol. 33(1), pages 49-64, February.
  39. Beasley, J. E., 1985. "A note on solving large p-median problems," European Journal of Operational Research, Elsevier, vol. 21(2), pages 270-273, August.
  40. Beasley, J. E., 1985. "An algorithm for the two-dimensional assortment problem," European Journal of Operational Research, Elsevier, vol. 19(2), pages 253-261, February.
  41. Beasley, JE, 1985. "Strategies for corporate and business success--A survey," Omega, Elsevier, vol. 13(1), pages 51-58.
  42. Tan, C.C.R. & Beasley, J.E., 1984. "A heuristic algorithm for the period vehicle routing problem," Omega, Elsevier, vol. 12(5), pages 497-504.
  43. Wong, KF & Beasley, JE, 1984. "Vehicle routing using fixed delivery areas," Omega, Elsevier, vol. 12(6), pages 591-600.
  44. Christofides, N. & Beasley, J. E., 1983. "Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem," European Journal of Operational Research, Elsevier, vol. 12(1), pages 19-28, January.
  45. Beasley, JE, 1983. "Route first--Cluster second methods for vehicle routing," Omega, Elsevier, vol. 11(4), pages 403-408.
  46. Christofides, N. & Beasley, J. E., 1982. "A tree search algorithm for the p-median problem," European Journal of Operational Research, Elsevier, vol. 10(2), pages 196-204, June.
  47. Wills, LA & Beasley, JE, 1982. "The use of strategic planning techniques in the United Kingdom," Omega, Elsevier, vol. 10(4), pages 433-440.
  48. Beasley, JE, 1981. "Adapting the savings algorithm for varying inter-customer travel times," Omega, Elsevier, vol. 9(6), pages 658-659.

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Rankings

This author is among the top 5% authors according to these criteria:
  1. Number of Citations, Weighted by Number of Authors
  2. h-index
  3. Number of Downloads through RePEc Services over the past 12 months, Weighted by Number of Authors
  4. Wu-Index

Co-authorship network on CollEc

NEP Fields

NEP is an announcement service for new working papers, with a weekly report in each of many fields. This author has had 2 papers announced in NEP. These are the fields, ordered by number of announcements, along with their dates. If the author is listed in the directory of specialists for this field, a link is also provided.
  1. NEP-RMG: Risk Management (2) 2019-09-02 2019-09-02
  2. NEP-FOR: Forecasting (1) 2019-09-02

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, John E Beasley should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.