Reducing work-in-process movement for multiple products in one-dimensional layout problems

Document Type

Article

Publication Date

1-1-1997

Abstract

This research describes a method to assign M machines, which are served by a material handling transporter, to M equidistant locations along a track, so that the distance traveled by a given set of jobs is minimized. Traditionally, this problem (commonly known as a machine location problem) has been modeled as a quadratic assignment problem (QAP), which is script N sign℘-hard, thus motivating the need for efficient procedures to solve instances with several machines. In this paper we develop a branching heuristic to obtain sub-optimum solutions to the problem; a lower bound on the optimum solution has also been presented. Results obtained from the heuristics are compared with results obtained from other heuristics with similar objectives. It is observed that the results are promising, and justify the usage of developed methods.

Publication Source (Journal or Book title)

Journal of the Operational Research Society

First Page

412

Last Page

422

This document is currently not available here.

Share

COinS