BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260522T150120Z
LOCATION:C2/3/4 Ballroom
DTSTART;TZID=America/Chicago:20181113T083000
DTEND;TZID=America/Chicago:20181113T170000
UID:submissions.supercomputing.org_SC18_sess322_post169@linklings.com
SUMMARY:High-Accuracy Scalable Solutions to the Dynamic Facility Layout Pr
 oblem
DESCRIPTION:Apan Qasem, Clara Novoa, Chandra Kolla, and Samantha Coyle (Te
 xas State University)\n\nThe dynamic facility layout problem (DFLP) is con
 cerned with finding arrangements of facilities within plant locations that
  minimize the sum of material handling and relocation costs over a plannin
 g horizon. DFLP is relevant in manufacturing engineering; accurate solutio
 ns can reduce operational costs by as much as 30%. We present a new scalab
 le solution that formulates the task of finding the optimal arrangement as
  a shortest-path (SP) problem. The new parallel algorithm to find the SP e
 mploys a problem-specific heuristic to substantially cut down the search s
 pace. Compiler-level optimizations improve the performance across differen
 t execution platforms, including an auto-tuning strategy to derive the opt
 imal SMT configuration on a POWER8 system. Results show a factor of 13 spe
 edup over existing methods. For the six-facilities problems the best known
  solution is reached and for sets with 15 and 30 facilities the solution i
 s within 2.83% and 5.66% of the best solution, respectively.\n\nRegistrati
 on Category: Tech Program Reg Pass, Exhibits Reg Pass\n\n
END:VEVENT
END:VCALENDAR