Scheduling and rostering problems involving valuable resources such as vehicles, machines or personnel occur in many organizations. Efficient utilization of these resources is obviously an important management consideration. From a mathematical point of view, scheduling applications give rise to many very challenging problems in combinatorial and computational optimization. The Set Partitioning model provides a natural representation of scheduling and rostering problems. In this talk, we will outline some practical applications of the set partitioning model and then discuss various mathematical properties of the model, which explain why some set partitioning problems are relatively easy to solve, and others are particularly difficult to solve. We will also outline some computational techniques based on these mathematical properties, which have been developed specifically to provide solutions to practical scheduling problems.
Current 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
