WOLFRAM
Products
Wolfram|One
Mathematica
Wolfram Notebook Assistant + LLM Kit
Wolfram|Alpha Notebook Edition
System Modeler
All Products
Consulting & Solutions
Wolfram Consulting
Industry Solutions
Solutions for Education
Learning & Support
Wolfram U Courses
Wolfram Language Resources
Wolfram Community
Support FAQs
Contact Support
Company
About Wolfram
Careers
Events
Educational Programs
All Sites and Resources
Wolfram|Alpha
Wolfram Cloud
Your Account
Your Account
User Portal
Search
Close
Enable JavaScript to interact with content and submit forms on Wolfram websites.
Learn how
For the newest resources, visit
Wolfram Repositories and Archives »
Title
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
Presentation-LibArtsMma.nb
(2.2 MB) -
Mathematica Notebook
For the newest resources, visit Wolfram Repositories and Archives »For the newest resources, visit Wolfram Repositories and Archives »
For the newest resources, visit Wolfram Repositories and Archives »
