File:Pinwheel scheduling.svg

Page contents not supported in other languages.
This is a file from the Wikimedia Commons
From Wikipedia, the free encyclopedia

Original file(SVG file, nominally 783 × 342 pixels, file size: 28 KB)

Summary

Description
English: An instance of the pinwheel scheduling problem: tasks A, B, and C have maximum repeat times 2, 4, and 5 respectively. The repeating schedule ABACABAC... solves this instance.
Date
Source Own work
Author David Eppstein

Licensing

I, the copyright holder of this work, hereby publish it under the following license:
Creative Commons CC-Zero This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication.
The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.

Captions

Pinwheel scheduling

Items portrayed in this file

depicts

16 November 2023

image/svg+xml

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current01:42, 17 November 2023Thumbnail for version as of 01:42, 17 November 2023783 × 342 (28 KB)David EppsteinUploaded own work with UploadWizard
The following pages on the English Wikipedia use this file (pages on other projects are not listed):

Metadata