Learning and practising supply chain management strategies from a business simulation game: a comprehensive supply chain simulation

An Internet based supply chain simulation game (ISCS) is introduced and demonstrated in this paper. Different from other games and extended from the Beer Game, a comprehensive set of supply chain (SC) management strategies can be tested in the game, and these strategies can be evaluated and appraised based on the built-in Management Information System (MIS). The key functionalities of ISCS are designed to increase players SC awareness, facilitate understanding on various SC strategies and challenges, foster collaboration between partners, and improve problem solving skills. It is concluded that an ISCS can be used as an efficient and effective teaching tool as well as a research tool in operations research and management science. Problems and obstacles have been observed while engaging in the SC business scenario game. The actions proposed and implemented to solve these problems have resulted in improved SC performance.

Integrating Aircraft Cost Modelling into Conceptual Design

The article presents cost modeling results from the application of the Genetic-Causal cost modeling principle. Industrial results from redesign are also presented to verify the opportunity for early concept cost optimization by using Genetic-Causal cost drivers to guide the conceptual design process for structural assemblies. The acquisition cost is considered through the modeling of the recurring unit cost and non-recurring design cost. The operational cost is modeled relative to acquisition cost and fuel burn for predominately metal or composites designs. The main contribution of this study is the application of the Genetic-Causal principle to the modeling of cost, helping to understand how conceptual design parameters impact on cost, and linking that to customer requirements and life cycle cost.

Scheduling and Platforming Trains at Busy Complex Stations

We consider the problem of train planning or scheduling for large, busy, complex train stations, which are common in Europe and elsewhere, though not in North America. We develop the constraints and objectives for this problem, but these are too computationally complex to solve by standard combinatorial search or integer programming methods. Also, the problem is somewhat political in nature, that is, it does not have a clear objective function because it involves multiple train operators with conflicting interests. We therefore develop scheduling heuristics analogous to those successfully adopted by train planners using ''manual'' methods. We tested the model and algorithms by applying to a typical large station that exhibits most of the complexities found in practice. The results compare well with those found by traditional methods, and take account of cost and preference trade-offs not handled by those methods. With successive refinements, the algorithm eventually took only a few seconds to run, the time depending on the version of the algorithm and the scheduling problem. The scheduling models and algorithms developed and tested here can be used on their own, or as key components for a more general system for train scheduling for a rail line or network.Train scheduling for a busy station includes ensuring that there are no conflicts between several hundred trains per day going in and out of the station on intersecting paths from multiple in-lines and out-lines to multiple platforms, while ensuring that each train is allowed at least its minimum required headways, dwell time, turnaround time and trip time. This has to be done while minimizing (costs of) deviations from desired times, platforms or lines, allowing for conflicts due to through-platforms, dead-end platforms, multiple sub-platforms, and possible constraints due to infrastructure, safety or business policy.