Correspondence: Lila Rasekh, Team Disney South 320F, 1375 Buena Vista Dr, Lake Buena Vista, Orlando, FL 32830, USA

¹is a PhD degree in Management Science from HEC-Montreal and McGill University in Canada. She currently works in the Decision Science team of Revenue Management at Walt Disney World. Her work focuses on Hotel, Cruise, Golf Course and Merchandise revenue management at WDW.

²is a PhD degree in Management Science from the University of Montreal. He has 25 years of experience in Mixed Integer Programming (MIP), focusing on column generation and large scale scheduling problems for the transportation industry. He worked on MIP problems for the airline industry for 7 years.

Received 26 May 2009; Revised 26 September 2009; Published online 6 November 2009.

Abstract

This research is based on an analysis of golf course tee-time reservation practice. Specifically, this article presents a unique linear model that can be used to assign the demand to the available tee-times, and thus, maximize their utilization and the total revenue. The model is solved by using the SAS-OR built-in branch and bound (B&B) algorithm. To reduce the computational time, we propose a heuristic to find an initial feasible solution to the model. This initial solution reduces the CPU time substantially and enabled us to solve the larger-scale problem by using the SAS-OR.