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:20181221T160904Z
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:Poster\nTech Program Reg Pass, Exhibits Reg Pass\n\nHigh-Accur
 acy Scalable Solutions to the Dynamic Facility Layout Problem\n\nQasem, No
 voa, Kolla, Coyle\n\nThe dynamic facility layout problem (DFLP) is concern
 ed with finding arrangements of facilities within plant locations that min
 imize the sum of material handling and relocation costs over a planning ho
 rizon. DFLP is relevant in manufacturing engineering; accurate solutions c
 an reduce operational costs by as much as 30%. We present a new scalable s
 olution that formulates the task of finding the optimal arrangement as a s
 hortest-path (SP) problem. The new parallel algorithm to find the SP emplo
 ys a problem-specific heuristic to substantially cut down the search space
 . Compiler-level optimizations improve the performance across different ex
 ecution platforms, including an auto-tuning strategy to derive the optimal
  SMT configuration on a POWER8 system. Results show a factor of 13 speedup
  over existing methods. For the six-facilities problems the best known sol
 ution is reached and for sets with 15 and 30 facilities the solution is wi
 thin 2.83% and 5.66% of the best solution, respectively.
URL:https://sc18.supercomputing.org/presentation/?id=post169&sess=sess322
END:VEVENT
END:VCALENDAR