To main content

Scoop Scheduler

Scoop Scheduler

You are here:

A solver for generalized Resource Constrained Project Scheduling Problems. With a rich problem model, and an adaptable set of algorithms, it is applicable to a wide range of real world planning- and scheduling problems.

Introduction

The Scoop Scheduler is a tool for solving generalized resource constrained scheduling problems. A rich set of real world problems can be modeled, including aspects such as min/max delays, multiple projects, multiple resource modes per activity, intra-project mode consistency constraints, "project discuntions", and stretchable activities. A number of common real world objectives are supported.
The tool is a member of SINTEF's Scoop software suite for optimisation. It can be integrated into third party software to efficiently solve complex planning and scheduling problems. While originally developed for detailed activity scheduling in hospitals, the software's generic model, and the associated optimisation algorithms, make it applicable to a wide range of production or activity scheduling applications. E.g., it has been applied to problems in airport runway- and surface scheduling and train scheduling.

Scoop Scheduler is developed by the Department of applied mathematics, and the optimisation group.

See below for a further description of this software.

Contact person

Atle Riise
Senior Research Scientist
922 48 389

Explore research areas

General model and optimization methods

Model

Scoop Scheduler implements a rich set of extensions to the resource constrained project scheduling problem (RCPSP), supporting:

* Multiple projects
* Minimum and maximum time lag constraints between activities
* Multiple modes (a mode is a combination of resources that can carry out an activity)
* Mode consistency constraints between activities in the same project
* "Project disjunction" constraints
* Renewable and non-reneable resources, with any capacity and calendar based availability
* etc.

Methods

This model can be used to express a wide range of real world integrated planning and scheduling problems. To solve these problems, Scoop Scheduler applies a self-configuring set of optimisation methods, each with its own strengths. On-line and off-line learning is used to adapt this framework so that these methods collaborate efficiently to provide optimal, or near optimal, solutions within the time requirements of the application.

Application Programming Interface (API)

Scoop Scheduler comes with a well documented WCF-based API, for easy integration into third party planning and scheduling software. This API gives the user the ability to:

* Set up complex planning and scheduling problems
* Compute optimal or near optimal schedules in a short time
* In a dynamic planning situation:
* Make modifications to the problem definition based on new information.
* Re-schedule to accommodate the new information, while maintaining closeness to the previously accepted schedule (to minimise the disruption to operations).

 

Hospital patient scheduling

When integrated in hospital planning software, Scoop Scheduler gives computational support for the planning of individual patients in hospitals. It automatically suggests optimal, or near optimal, patient schedules for all kinds of activities related to the examination and treatment of each patient. The availability and preferences of all necessary resources are considered. Many different planning situations are supported, ranging from long term admission or appointment planning, to very dynamic "on-the-day" patient re-scheduling ("coordination"). The software supports the scheduling of individual examination activities, as well as the coordinated planning of complex clinical (care) pathways across multiple hospital departments or clinics.

See also the page Optimisation in Health Care.

Relevant Papers

Publication

Recursive logic-based Benders’ decomposition for multi-mode outpatient scheduling

https://www.sintef.no/en/publications/publication/?pubid=1382546

Efficient outpatient scheduling is becoming increasingly important for the overall cost effectiveness and treatment efficiency of a hospital. We consider a class of multi-mode appointment scheduling problems, with variable resource availability and resource setup times. These problems are frequently...

Authors Atle Riise Carlo Mannino Leonardo Cameron Lamorgese
Year 2016
Type Academic article
Publication

The Surgery Scheduling Problem - A General Model

https://www.sintef.no/en/publications/publication/?pubid=CRIStin+1268319

The term surgery scheduling is used about a variety of strategic, tactical and operational scheduling problems, many of which are critical to an efficient use of hospital resources. Our focus is on operational surgery scheduling problems, which are often NP-hard. The exact problem formulation varies...

Authors Riise Atle Mannino Carlo
Year 2012
Type Report/thesis

Related Content

The optimal result

15 October 2014

We don’t just want the best. We want the very best.

Design affects patient care

06 June 2012

The design of “bed clusters” is important.

universAAL Project

Start: 2010
End: 2014

universAAL was a European FP7 funded project led by SINTEF. In this page you will find some information about the project, and links to follow-up activities by universAAL partners.

DynamITe competence project

Start: 01/06/2015
End: 31/12/2019

New optimization models and solution algorithms are needed to develop systems and services for intermodal personal journey planning and vehicle routing that handle dynamics effectively and efficiently.

Tracking services for people with cognitive impairment

Start: 01/08/2015
End: 30/09/2016

A case study of the implementation of GPS-based tracking services for people with cognitive impairment

KuPA

Start: 2012
End: 2015

More than 72 000 people in Norway are suffering from demetia. Each year 10 000 new cases are registered. Approximately 250 000 family members are affected by the disease. People with dementia have problems coping with their daily activities.