(A) study on assignment of facilities to locations in a serial line

Abstract

This thesis deals with the problem of assigning workstations whose objective is the minimum total weighted travel distance in a linear facility. Two separate models are considered; one with fixed input/output workstations and equal machine lenght, and the other with no preassigned workstations and unequal machine length. We propose heuristic algorithms for each model and compare with this by an existing solution procedure. Through the tests of hypothetical problems, it is confirmed that the algorithms perform slightly better than existing methods.