Wolfram Library Archive


Courseware Demos MathSource Technical Notes
All Collections Articles Books Conference Proceedings
Title Downloads

Mathematica for the Liberal Arts
Author

Bruce F. Torrence
Conference

2003 Mathematica Developer Conference
Conference location

Champaign
Description

Given:

• A finite list of tasks T1, T2, T3, ... Tn, each with an associated completion time.

• An (irreflexive) partial order on the task set, indicating precedence constraints.

Produce a feasible schedule whose total completion time (makespan) is minimal
Subject

*Mathematics > Discrete Mathematics > Graph Theory
Keywords

Scheduling Problem
URL

http://faculty.rmc.edu/btorrenc/index.html
Downloads Download Wolfram CDF Player

Download
Presentation-LibArtsMma.nb (2.2 MB) - Mathematica Notebook