Graham Kendall
Various Images

Professor Graham Kendall

Professor Graham Kendall is the Provost and CEO of The University of Nottingham Malaysia Campus (UNMC). He is also a Pro-Vice Chancellor of the University of Nottingham.

He is a Director of MyResearch Sdn Bhd, Crops for the Future Sdn Bhd. and Nottingham Green Technologies Sdn Bhd. He is a Fellow of the British Computer Society (FBCS) and a Fellow of the Operational Research Society (FORS).

He has published over 230 peer reviewed papers. He is an Associate Editor of 10 journals and the Editor-in-Chief of the IEEE Transactions of Computational Intelligence and AI in Games.

News

I have published a few papers on Sports Scheduling.
http://bit.ly/gVaUqT
I have published a few papers on Sports Scheduling.
http://bit.ly/gVaUqT

Latest Blog Post

Snooker: Celebrating 40 years at the Crucible

Random Blog Post

How would you like to promote your scientific paper in a five minute video

Publication(s)

An efficient guided local search approach for service network design problem with asset balancing
http://bit.ly/fY7uch
Investigating the Use of Local Search for Improving Meta-Hyper-Heuristic Performance
http://bit.ly/1csb3rG
Evaluating decision-making units under uncertainty using fuzzy multi-objective nonlinear programming
http://bit.ly/2k79ATE
When Sports Rules Go Awry
http://bit.ly/2ehzLjV

Graham Kendall: Details of Requested Publication


Citation

Bak, S; Blazewicz, J; Pawlak, G; Plaza, M; Burke, E.K and Kendall, G A Parallel Branch-and-Bound Approach to the Rectangular Guillotine Strip Cutting Problem. INFORMS Journal on Computing, 23 (1): 15-25, 2011.


Abstract

This paper presents a parallel branch-and-bound method to address the two-dimensional rectangular guillotine strip cutting problem. Our paper focuses on a parallel branching schema. We present a series of computational experiments to evaluate the strength of the approach. Optimal solutions have been found for some benchmark instances that had unknown solutions until now. For many other instances, we demonstrate that the proposed approach is time effective. The efficiency of the parallel version of the algorithm is compared and the speedup, when increasing the number of processors, is clearly demonstrated with an upper bound calculated by a specialised heuristic procedure.


pdf

There is no pdf available for this paper. You might like to try to obtain the original source (see the doi, for example)


doi

The doi for this publication is 10.1287/ijoc.1100.0394 You can link directly to the original paper, via the doi, from here

What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information


Journal Rankings


ISI Web of Knowledge Journal Citation Reports

The Web of Knowledge Journal Citation Reports (often known as ISI Impact Factors) help measure how often an article is cited. You can get an introduction to Journal Citation Reports here. Below I have provided the ISI impact factor for the jourrnal in which this article was published. For complete information I have shown the ISI ranking over a number of years, with the latest ranking highlighted.

2014 (1.077), 2013 (1.120), 2012 (1.370), 2011 (1.076), 2010 (1.172), 2009 (1.318), 2008 (1.041), 2007 (0.907), 2006 (0.865), 2005 (1.762), 2004 (1.522), 2003 (0.761), 2002 (0.979), 2001 (0.729)

URL

This pubication does not have a URL associated with it.

The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.


Bibtex

@ARTICLE{bbppbk2011, author = {S. Bak and J. Blazewicz and G. Pawlak and M. Plaza and E.K. Burke and G. Kendall},
title = {A Parallel Branch-and-Bound Approach to the Rectangular Guillotine Strip Cutting Problem},
journal = {INFORMS Journal on Computing},
year = {2011},
volume = {23},
pages = {15-25},
number = {1},
abstract = {This paper presents a parallel branch-and-bound method to address the two-dimensional rectangular guillotine strip cutting problem. Our paper focuses on a parallel branching schema. We present a series of computational experiments to evaluate the strength of the approach. Optimal solutions have been found for some benchmark instances that had unknown solutions until now. For many other instances, we demonstrate that the proposed approach is time effective. The efficiency of the parallel version of the algorithm is compared and the speedup, when increasing the number of processors, is clearly demonstrated with an upper bound calculated by a specialised heuristic procedure.},
doi = {10.1287/ijoc.1100.0394},
issn = {1091-9856},
keywords = {production scheduling, cutting stock, packing, cutting, material handling, parallel branch-and-bound method, analysis of algorithms, branch and bound},
owner = {gxk},
timestamp = {2010.12.03} }