BEGIN:VCALENDAR
CALSCALE:GREGORIAN
VERSION:2.0
METHOD:PUBLISH
PRODID:-//Drupal iCal API//EN
X-WR-TIMEZONE:America/New_York
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
DTSTART:20070311T020000
TZNAME:EDT
TZOFFSETTO:-0400
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
DTSTART:20071104T020000
TZNAME:EST
TZOFFSETTO:-0500
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
SEQUENCE:1
X-APPLE-TRAVEL-ADVISORY-BEHAVIOR:AUTOMATIC
UID:239651
DTSTAMP:20260727T114556Z
DTSTART;TZID=America/New_York:20260807T133000
DTEND;TZID=America/New_York:20260807T140000
URL;TYPE=URI:https://www.wpi.edu/news/calendar/events/rbe-masters-capstone-
 presentation-benjamin-cruse
SUMMARY:RBE Masters Capstone Presentation - Benjamin Cruse
DESCRIPTION:MASTH-Minimum Auction Spanning Task Hierarchy\n\n\n\n      \n  
     \n\n\n\nAbstract: As manufacturing grows more sophisticated and dynami
 c, methods of scheduling tasks to a limited pool of machines become especi
 ally relevant and important. The flexible job shop problem (FJSP) assigns 
 machines with different capabilities and processing speeds to tasks while 
 optimizing makespan or another objective. Because the FJSP’s search space 
 grows combinatorially with the number of tasks and machines, methods such 
 as mixed-integer linear programming (MILP), greedy heuristics, and Tabu se
 arch can struggle with either runtime or solution quality at larger scales
 . This project introduces Minimum Auction Spanning Task Hierarchy (MASTH),
  a metaheuristic that combats combinatorial growth by exploiting inherent 
 similarities among tasks and machines. MASTH consists of deterministic ass
 ignment nodes that respond to stimuli by delegating and reassigning machin
 es to open tasks. These nodes operate using only locally available informa
 tion, allowing for MASTH to operate within a distributed system. Arranging
  these nodes hierarchically limits the number of machines considered for e
 ach task: rather than searching the full machine population, the hierarchy
  searches for machines that are nearby in its artificial space. If a hiera
 rchy is well constructed (e.g., the distances between tasks in the hierarc
 hy correlate to how apt a machine operating on one task is for another) th
 e closest available machine is likely an adequate candidate for a task. MA
 STH offers assignment schedules significantly faster than MILP for larger 
 scenarios and offers plans with makespans shorter than a Tabu search.\nAdv
 isor: Professor Kevin Leahy\nZoom link: https://wpi.zoom.us/j/99383275406.
 \n
END:VEVENT
END:VCALENDAR