26.11.2012 Views

Technical Sessions – Monday July 11

Technical Sessions – Monday July 11

Technical Sessions – Monday July 11

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

FB-06 IFORS 20<strong>11</strong> - Melbourne<br />

2 - Perils of the Advantage Set<br />

Alan Brown, retired, 14 Rowell Street, Rosanna, 3084,<br />

Melbourne, Victoria, Australia, abrown@labyrinth.net.au<br />

In tennis, the stopping rules for an advantage set are poorly designed, and the<br />

total number of games required to determine the winner is not well controlled.<br />

When the advantage set is played, the standard deviation of the number of<br />

games is a poor measure of risk of very long matches. Analysis of the distribution<br />

of the number of games in an advantage set provides a simple practical<br />

example where the Normal Power approximation fails. It is proposed that the<br />

advantage set be replaced by short tie-breaker sets in tournament matches.<br />

3 - Analyzing Tennis Scoring Systems: From the Origins<br />

to Today<br />

Tristan Barnett, School of Mathematics and Statistics, University<br />

of South Australia, 1/<strong>11</strong> Findon St, Hawthorn, 3122, Melbourne,<br />

Victoria, Australia, strategicgames@hotmail.com<br />

This paper investigates tennis scoring systems that have been used throughout<br />

history — from Royal Tennis in 1490 to the most recent change to doubles<br />

Lawn Tennis in 2006. By identifying how the game has changed (such as<br />

technology in equipment) this helps to establish "reasonable’ scoring systems<br />

that could be used for today. Based on this information and obtaining mathematical<br />

results of scoring systems, recommendations are given for men’s and<br />

women’s singles and doubles events. Actual matches are given to demonstrate<br />

why changes in many scoring systems are necessary.<br />

� FB-06<br />

Friday, 13:15-14:45<br />

Meeting Room 105<br />

Logistics<br />

Stream: Transportation<br />

Invited session<br />

Chair: Said Salhi, Kent Business School, University of Kent, Centre<br />

for Heuristic Optimisation„ Canterbury, Kent, CT2 7PE, United<br />

Kingdom, s.salhi@kent.ac.uk<br />

1 - Pricing for Production and Delivery Flexibility<br />

Martin Savelsbergh, CSIRO, NSW 1670, North Ryde, Australia,<br />

Martin.Savelsbergh@csiro.au, George Nemhauser, Yaxian Li<br />

Adjusting prices to influence demand to increase revenue has become common<br />

practice. We investigate adjusting prices to influence demand to reduce cost.<br />

We consider offering price discounts in return for delivery flexibility in a singleitem<br />

uncapacitated lot-sizing context. Even though the resulting optimization<br />

problem has a nonlinear objective function it can still be solved in polynomial<br />

time under Wagner-Whitin cost conditions. Furthermore, we report results of a<br />

computational study analyzing the benefits of offering price discounts in return<br />

for delivery flexibility in various settings.<br />

2 - Metaheuristics for Order Batching and Batch Sequencing<br />

in Manual Order Picking Systems<br />

Sebastian Henn, Faculty of Economics and Management,<br />

Otto-von-Guericke University Magdeburg, Universitätsplatz 2,<br />

39106, Magdeburg, Germany, sebastian.henn@ovgu.de<br />

Order picking deals with the retrieval of articles from their storage locations<br />

in order to satisfy customer requests. Major issues in manual picking systems<br />

are the transformation of customer orders into picking orders and the determination<br />

of picking tours. In practice, customer orders have to be completed by<br />

certain due dates. The observance of these dates is influenced by the composition<br />

of the batches, their tour lengths and by the sequence according to which<br />

the batches are processed. It is presented, how metaheuristics can be used to<br />

minimize the tardiness for given customer orders.<br />

� FB-07<br />

Friday, 13:15-14:45<br />

Meeting Room 106<br />

Healthcare Systems and Queues<br />

Stream: Applied Probability<br />

Invited session<br />

Chair: Ilze Ziedins, University of Auckland, 1010, Auckland, New<br />

Zealand, i.ziedins@auckland.ac.nz<br />

<strong>11</strong>8<br />

1 - Some Observations Concerning Priority Queues<br />

Mark Fackrell, Mathematics and Statistics, The University of<br />

Melbourne, 3010, Melbourne, Victoria, Australia,<br />

fackrell@unimelb.edu.au<br />

We consider a single server queue with two types of customers, each type arriving<br />

according to a Poisson process, with possibly different rates. One type of<br />

customer is labelled “high priority”, the other “low priority”. Once a customer<br />

arrives to the queue they begin accumulating priority at a fixed rate, depending<br />

on their priority class. We present some theoretical and simulation results for<br />

the nonpreemptive priority queue mentioned above, and extend the analysis to<br />

queues with more than two priority classes of customers.<br />

2 - A New Paradigm for Priority Patient Selection<br />

David Stanford, Dept. of Statistical & Actuarial Sciences, The<br />

University of Western Ontario, WSC 262, <strong>11</strong>51 Richmond Street<br />

N., N6A 5B7, London, Ontario, Canada, stanford@stats.uwo.ca,<br />

Peter Taylor, Ilze Ziedins<br />

In many health care systems: 1) Key Performance Indicators (KPIs) specify<br />

the fraction of patients needing to be seen by some key time point. 2) Patient<br />

classes present themselves for care in a fashion that is totally independent of<br />

the KPIs. There is no reason to expect the resulting system performance will<br />

adhere to the specified KPIs. The present work presents a new paradigm for<br />

priority assignment that enables one to fine-tune the system in order to achieve<br />

the delay targets, assuming sufficient capacity exists for at least one such arrangement.<br />

3 - Modelling Patient Flow through a Cardio-vascular Intensive<br />

Care Unit<br />

Ilze Ziedins, University of Auckland, 1010, Auckland, New<br />

Zealand, i.ziedins@auckland.ac.nz<br />

We describe a simulation model of an intensive care unit, and an associated optimization<br />

routine, that were developed for the Cardiovascular Intensive Care<br />

Unit at Auckland City Hospital. Acute patients arrive as a time varying Poisson<br />

process, while elective patients are modelled as deterministic arrivals. Lengths<br />

of stay are drawn from the empirical distributions for different types of patients.<br />

The model has been used to determine the number of beds that are needed in<br />

the unit, and to explore the benefits of flexible rostering.<br />

� FB-08<br />

Friday, 13:15-14:45<br />

Meeting Room 107<br />

Natural Resource Management<br />

Stream: Dynamic Programming<br />

Invited session<br />

Chair: Julia Piantadosi, School of Mathematics and Statistics,<br />

University of South Australia, Mawson Lakes Campus, Mawson<br />

Lakes Boulevard, Mawson Lakes, 5095, Adelaide, South Australia,<br />

julia.piantadosi@unisa.edu.au<br />

1 - Time Series Analysis of Daily Rainfall<br />

John Boland, School of Mathematics and Statistics, University of<br />

South Australia, Mawson Lakes Blvd., 5095, Mawson Lakes,<br />

South Australia, Australia, john.boland@unisa.edu.au<br />

How correlated is daily rainfall? It is common to model daily rainfall totals as a<br />

Markov Chain. However, we conjecture that dependence at longer time scales,<br />

typically of the order of one week, can be important. Standard procedures do<br />

not capture this longer range dependence. We show the use of multiple regression<br />

and principal component analysis in this problem.<br />

2 - Effective Decision Making Polices for Multi-reservoir<br />

Systems<br />

Sara Browning, Mathematics and Statistics, University of South<br />

Australia, Mawson Lakes Campus, Mawson Lakes, 5095,<br />

Adelaide, SA, Australia, sara.browning@mymail.unisa.edu.au<br />

We are interested in developing more effective decision making polices for<br />

multi-reservoir systems using a variety of mathematical processes such as<br />

stochastic dynamic programming (SDP) and decomposition. We have developed<br />

an SDP formulation for the major storage areas of the Murray-Darling<br />

basin using a decomposition procedure which compares favourably to SDP solutions<br />

of the whole system. By incorporating methods of risk management we<br />

aim to develop an efficient and comprehensible model to determine economic<br />

water management policies whilst avoiding environmental damage to the water<br />

system.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!