2025-01-22 10:10:40

This commit is contained in:
Isaac Shoebottom 2025-01-22 10:10:40 -04:00
parent 7ba74544b4
commit ae285129c8
3 changed files with 17 additions and 4 deletions

View File

@ -1 +1 @@
{"algorithm":{"algorithm":{"currentFile":{"count":1,"lastUpdated":1736360369637}}},"computing":{"computing":{"currentFile":{"count":2,"lastUpdated":1736427522780}}},"tasks":{"tasks":{"currentFile":{"count":1,"lastUpdated":1736428160890}}},"parallelization":{"parallelization":{"currentFile":{"count":1,"lastUpdated":1736428239757}}},"Implicit":{"Implicit":{"currentFile":{"count":1,"lastUpdated":1736429811730}}},"Semi-implicit":{"Semi-implicit":{"currentFile":{"count":1,"lastUpdated":1736429857427}}},"Agent":{"Agent":{"currentFile":{"count":1,"lastUpdated":1736527234430}}},"Agents":{"Agents":{"currentFile":{"count":3,"lastUpdated":1736528265726}}},"actions":{"actions":{"currentFile":{"count":1,"lastUpdated":1736527553391}}},"successful":{"successful":{"currentFile":{"count":1,"lastUpdated":1736527687166}}},"agents":{"agents":{"currentFile":{"count":3,"lastUpdated":1736529446424}}},"environment":{"environment":{"currentFile":{"count":4,"lastUpdated":1736962288019}}},"actuators":{"actuators":{"currentFile":{"count":1,"lastUpdated":1736528278631}}},"Sensors":{"Sensors":{"currentFile":{"count":1,"lastUpdated":1736528280975}}},"state":{"state":{"currentFile":{"count":1,"lastUpdated":1736529437831}}},"types":{"types":{"currentFile":{"count":1,"lastUpdated":1736529458373}}},"Operatiosn":{"Operatiosn":{"currentFile":{"count":1,"lastUpdated":1736530551849}}},"Algorithms":{"Algorithms":{"currentFile":{"count":1,"lastUpdated":1736792441945}}},"Problem":{"Problem":{"currentFile":{"count":2,"lastUpdated":1736963119655}}},"parallel":{"parallel":{"currentFile":{"count":2,"lastUpdated":1736858881146}}},"processing":{"processing":{"currentFile":{"count":1,"lastUpdated":1736858379041}}},"resources":{"resources":{"currentFile":{"count":1,"lastUpdated":1736858873851}}},"Reduce":{"Reduce":{"currentFile":{"count":1,"lastUpdated":1736859169038}}},"minimized":{"minimized":{"currentFile":{"count":1,"lastUpdated":1736860208884}}},"oriented":{"oriented":{"currentFile":{"count":1,"lastUpdated":1736860250593}}},"Memory":{"Memory":{"currentFile":{"count":1,"lastUpdated":1736860492193}}},"nodes":{"nodes":{"currentFile":{"count":1,"lastUpdated":1736861731850}}},"benefit":{"benefit":{"currentFile":{"count":1,"lastUpdated":1736963283168}}},"weight":{"weight":{"currentFile":{"count":1,"lastUpdated":1736963351487}}},"Science":{"Science":{"currentFile":{"count":3,"lastUpdated":1736978641182}}},"philosophy":{"philosophy":{"currentFile":{"count":1,"lastUpdated":1736978932932}}},"scientists":{"scientists":{"currentFile":{"count":1,"lastUpdated":1736979775741}}},"knowledge":{"knowledge":{"currentFile":{"count":1,"lastUpdated":1736982926940}}},"Design":{"Design":{"currentFile":{"count":1,"lastUpdated":1737031267035}}},"Model":{"Model":{"currentFile":{"count":1,"lastUpdated":1737464038874}}}}
{"algorithm":{"algorithm":{"currentFile":{"count":1,"lastUpdated":1736360369637}}},"computing":{"computing":{"currentFile":{"count":2,"lastUpdated":1736427522780}}},"tasks":{"tasks":{"currentFile":{"count":1,"lastUpdated":1736428160890}}},"parallelization":{"parallelization":{"currentFile":{"count":1,"lastUpdated":1736428239757}}},"Implicit":{"Implicit":{"currentFile":{"count":1,"lastUpdated":1736429811730}}},"Semi-implicit":{"Semi-implicit":{"currentFile":{"count":1,"lastUpdated":1736429857427}}},"Agent":{"Agent":{"currentFile":{"count":1,"lastUpdated":1736527234430}}},"Agents":{"Agents":{"currentFile":{"count":3,"lastUpdated":1736528265726}}},"actions":{"actions":{"currentFile":{"count":1,"lastUpdated":1736527553391}}},"successful":{"successful":{"currentFile":{"count":1,"lastUpdated":1736527687166}}},"agents":{"agents":{"currentFile":{"count":3,"lastUpdated":1736529446424}}},"environment":{"environment":{"currentFile":{"count":4,"lastUpdated":1736962288019}}},"actuators":{"actuators":{"currentFile":{"count":1,"lastUpdated":1736528278631}}},"Sensors":{"Sensors":{"currentFile":{"count":1,"lastUpdated":1736528280975}}},"state":{"state":{"currentFile":{"count":1,"lastUpdated":1736529437831}}},"types":{"types":{"currentFile":{"count":1,"lastUpdated":1736529458373}}},"Operatiosn":{"Operatiosn":{"currentFile":{"count":1,"lastUpdated":1736530551849}}},"Algorithms":{"Algorithms":{"currentFile":{"count":1,"lastUpdated":1736792441945}}},"Problem":{"Problem":{"currentFile":{"count":2,"lastUpdated":1736963119655}}},"parallel":{"parallel":{"currentFile":{"count":2,"lastUpdated":1736858881146}}},"processing":{"processing":{"currentFile":{"count":1,"lastUpdated":1736858379041}}},"resources":{"resources":{"currentFile":{"count":1,"lastUpdated":1736858873851}}},"Reduce":{"Reduce":{"currentFile":{"count":1,"lastUpdated":1736859169038}}},"minimized":{"minimized":{"currentFile":{"count":1,"lastUpdated":1736860208884}}},"oriented":{"oriented":{"currentFile":{"count":1,"lastUpdated":1736860250593}}},"Memory":{"Memory":{"currentFile":{"count":1,"lastUpdated":1736860492193}}},"nodes":{"nodes":{"currentFile":{"count":1,"lastUpdated":1736861731850}}},"benefit":{"benefit":{"currentFile":{"count":1,"lastUpdated":1736963283168}}},"weight":{"weight":{"currentFile":{"count":1,"lastUpdated":1736963351487}}},"Science":{"Science":{"currentFile":{"count":3,"lastUpdated":1736978641182}}},"philosophy":{"philosophy":{"currentFile":{"count":1,"lastUpdated":1736978932932}}},"scientists":{"scientists":{"currentFile":{"count":1,"lastUpdated":1736979775741}}},"knowledge":{"knowledge":{"currentFile":{"count":1,"lastUpdated":1736982926940}}},"Design":{"Design":{"currentFile":{"count":1,"lastUpdated":1737031267035}}},"Model":{"Model":{"currentFile":{"count":1,"lastUpdated":1737464038874}}},"customers":{"customers":{"currentFile":{"count":1,"lastUpdated":1737553912552}}}}

View File

@ -13,12 +13,12 @@
"state": {
"type": "markdown",
"state": {
"file": "UNB/Year 5/Semester 2/CS3383/Lecture Notes.md",
"file": "UNB/Year 5/Semester 2/CS3383/Tutorial Notes.md",
"mode": "source",
"source": false
},
"icon": "lucide-file",
"title": "Lecture Notes"
"title": "Tutorial Notes"
}
}
]
@ -167,12 +167,13 @@
},
"active": "a4868a0d0ec2cb3a",
"lastOpenFiles": [
"UNB/Year 5/Semester 2/CS3383/Lecture Notes.md",
"UNB/Year 5/Semester 2/CS3383/Tutorial Notes.md",
"UNB/Year 5/Semester 2/CS4745/Lecture Notes.md",
"UNB/Year 5/Semester 2/CS4725/Lecture Notes.md",
"UNB/Year 5/Semester 2/CS4613/Lecture Notes.md",
"UNB/Year 5/Semester 2/HIST3925/Breakout Questions.md",
"UNB/Year 5/Semester 2/HIST3925/Lecture Notes.md",
"UNB/Year 5/Semester 2/CS3383/Lecture Notes.md",
"UNB/Year 5/Semester 2/CS4725",
"UNB/Year 5/Semester 2/CS4613",
"UNB/Year 5/Semester 2/CS4745",

View File

@ -0,0 +1,12 @@
# Schedule Problem
A singler server has n customers to serve. The sere time t_i required by each customer i is known in advance. Goal is to minimize T, the time in the system for customer i.
For example, t_1=5, t_2=10, t_3=3. Schedule 1: 123, Schedule 2: 231
Input: The set C of all customers C = { t_1, ... }. t_i is the service time for customer i
Output: The total time in the system for all customers
Merge Sort C in ascending order. A greedy solution works in this case.
We can simply run through the sorted list and serve them in order.
But if we assume the greedy algorithm is not optimal in this case