Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Mathematics LibreTexts

7: Scheduling

( \newcommand{\kernel}{\mathrm{null}\,}\)

  • 7.1: Introduction
    The problem of scheduling is fairly universal. Contractors need to schedule workers and subcontractors to build a house as quickly as possible. A magazine needs to schedule writers, editors, photographers, typesetters, and others so that an issue can be completed on time.
  • 7.2: Getting Started
  • 7.3: Adding an algorithm
    Up until now, we have been creating schedules by guess-and-check, which works well enough for small schedules, but would not work well with dozens or hundreds of tasks. To create a more procedural approach, we might begin by somehow creating a priority list. Once we have a priority list, we can begin scheduling using that list and the list processing algorithm.
  • 7.4: Choosing a Priority List
    We will explore two algorithms for selecting a priority list: the decreasing time algorithm and the critical path algorithm.
  • 7.5: Exercises

Thumbnail: pixabay.com/photos/airport-t...-times-690556/


This page titled 7: Scheduling is shared under a CC BY-SA 3.0 license and was authored, remixed, and/or curated by David Lippman (The OpenTextBookStore) via source content that was edited to the style and standards of the LibreTexts platform.

  • Was this article helpful?

Support Center

How can we help?