The Surrey Analytics Research group is hosting a 3 day course this August to provide comprehensive introduction to Data Analytics and Business Analytics.
I am looking for people interested in obtaining a full-time PhD. Candidates should have a strong quantitative background; experience in computer science and interest in Management Science (Operational Research).
KTP ... Knowledge Transfer Partnership.
If you are interested in a KTP please contact me. Potential future projects may be funded by Innovate UK.
Please feel welcome to drop in anytime during these hours (during term times). If you prefer different times, please feel free to send me an email to arrange an appointment.
Note: My office is currently located in 20 MS02.
Existing works in the supply chain complexity area have either focused on the overall behavior of multi-firm complex adaptive systems (CAS) or on listing specific tools and techniques that business units (BUs) can use to manage supply chain complexity, but without providing a thorough discussion about when and why they should be deployed. This research seeks to address this gap by developing a conceptually sound model, based on the literature, regarding how an individual BU should reduce versus absorb supply chain complexity. This research synthesizes the supply chain complexity and organizational design literature to present a conceptual model of how a BU should respond to supply chain complexity. We illustrate the model through a longitudinal case study analysis of a packaged foods manufacturer. Regardless of its type or origin, supply chain complexity can arise due to the strategic business requirements of the BU (strategic) or due to suboptimal business practices (dysfunctional complexity). Consistent with the proposed conceptual model, the illustrative case study showed that a firm must first distinguish between strategic and dysfunctional drivers prior to choosing an organizational response. Furthermore, it was found that efforts to address supply chain complexity can reveal other system weaknesses that lie dormant until the system is stressed. The case study provides empirical support for the literature-derived conceptual model. Nevertheless, any findings derived from a single, in-depth case study require further research to produce generalizable results. The conceptual model presented here provides a more granular view of supply chain complexity, and how an individual BU should respond, than what can be found in the existing literature. The model recognizes that an individual BU can simultaneously face both strategic and dysfunctional complexity drivers, each requiring a different organizational response. We are aware of no other research works that have synthesized the supply chain complexity and organizational design literature to present a conceptual model of how an individual business unit (BU) should respond to supply chain complexity. As such, this paper furthers our understanding of supply chain complexity effects and provides a basis for future research, as well as guidance for BUs facing complexity challenges.
Decision making is often based on Bayesian networks. The building blocks for Bayesian networks are its conditional probability tables (CPTs). These tables are obtained by parameter estimation methods, or they are elicited from subject matter experts (SME). Some of these knowledge representations are insufficient approximations. Using knowledge fusion of cause and effect observations lead to better predictive decisions. We propose three new methods to generate CPTs, which even work when only soft evidence is provided. The first two are novel ways of mapping conditional expectations to the probability space. The third is a column extraction method, which obtains CPTs from nonlinear functions such as the multinomial logistic regression. Case studies on military effects and burnt forest desertification have demonstrated that so derived CPTs have highly reliable predictive power, including superiority over the CPTs obtained from SMEs. In this context, new quality measures for determining the goodness of a CPT and for comparing CPTs with each other have been introduced. The predictive power and enhanced reliability of decision making based on the novel CPT generation methods presented in this paper have been confirmed and validated within the context of the case studies.
In this paper a demand time series is analysed to support Make-To-Stock (MTS) and Make-To-Order (MTO) production decisions. Using a purely MTS production strategy based on the given demand can lead to unnecessarily high inventory levels thus it is necessary to identify likely MTO episodes. This research proposes a novel outlier detection algorithm based on special density measures. We divide the time series' histogram into three clusters. One with frequent-low volume covers MTS items whilst a second accounts for high volumes which is dedicated to MTO items. The third cluster resides between the previous two with its elements being assigned to either the MTO or MTS class. The algorithm can be applied to a variety of time series such as stationary and non-stationary ones. We use empirical data from manufacturing to study the extent of inventory savings. The percentage of MTO items is reflected in the inventory savings which were shown to be an average of 18.1%.
Industrial practices and experiences highlight that demand is dynamic and non-stationary. Research however has historically taken the perspective that stochastic demand is stationary therefore limiting its impact for practitioners. Manufacturers require schedules for multiple products that decide the quantity to be produced over a required time span. This work investigated the challenges for production in the framework of a single manufacturing line with multiple products and varying demand. The nature of varying demand of numerous products lends itself naturally to an agile manufacturing approach. We propose a new algorithm that iteratively refines production windows and adds products. This algorithm controls parallel genetic algorithms (pGA) that find production schedules whilst minimizing costs. The configuration of such a pGA was essential in influencing the quality of results. In particular providing initial solutions was an important factor. Two novel methods are proposed that generate initial solutions by transforming a production schedule into one with refined production windows. The first method is called factorial generation and the second one fractional generation method. A case study compares the two methods and shows that the factorial method outperforms the fractional one in terms of costs.
In this paper we study the profitability of car manufacturers in relation to industry-wide profitability targets such as industry averages. Specifically we are interested in whether firms adjust their profitability in the direction of these targets, whether it is possible to detect any such change, and, if so, what the precise nature is of these changes. This paper introduces several novel methods to assess the trajectory of profitability over time. In doing so we make two contributions to the current body of knowledge regarding the dynamics of profitability. First, we develop a method to identify multiple profitability targets. We define these targets in addition to the commonly used industry average target. Second, we develop new methods to express movements in the profitability space from t to t + j, and define a notion of agreement between one movement and another. We use empirical data from the car industry to study the extent to which actual movements are in alignment with these targets. Here we calculate the three targets that we have previously identified, and contrast them with the actual profitability movements using our new agreement measure. We find that firms tend to move more towards to the new targets we have identified than to the common industry average. © 2012 Elsevier B.V. All rights reserved.
You can play against "Edi" a chess program using Matlab. It uses a greedy heuristic to find the "best" move.
Page Owner: msx1wg
Page Created: Thursday 23 July 2009 13:59:09 by t00346
Last Modified: Thursday 5 January 2017 09:28:26 by pj0010
Assembly date: Wed Aug 23 14:34:59 BST 2017
Content ID: 10390