Publication Date

Spring 2020

Degree Type

Master's Project

Degree Name

Master of Science (MS)

Department

Computer Science

First Advisor

Robert Chun

Second Advisor

Chris Tseng

Third Advisor

Long Nguyen

Keywords

Rehearsal scheduling problem, Constraint Programming, Integer Programming, Schedule Generation Schemes

Abstract

Scheduling is a common task that plays a crucial role in many industries such as manufacturing or servicing. In a competitive environment, effective scheduling is one of the key factors to reduce cost and increase productivity. Therefore, scheduling problems have been studied by many researchers over the past thirty years. Rehearsal scheduling problem (RSP) is similar to the popular resource-constrained project scheduling problem (RCPSP); however, it does not have activity precedence constraints and the resources’ availabilities are not fixed during processing time. RSP can be used to schedule rehearsal in theatre industry or to schedule group scheduling when each member has different sets of available time. In this report, three different approaches are proposed to solve RSP including Constraint Programming, Integer Programming, and Schedule Generation Schemes.

Download

Share

COinS