Flow distance reduction for a multi-product flowline with sets of identical machines

Diponegoro, Ahmad dan Sarker, Bhaba R. (2003) Flow distance reduction for a multi-product flowline with sets of identical machines. European Journal of Operational Research, 147 (3). pp. 591-612. ISSN 03772217

Full text not available from this repository.
Official URL: http://doi.org/10.1016/S0377-2217(02)00370-3


A group of M machines for processing a set of jobs in a manufacturing system is often located in a serial line. An efficient strategy for locating these machines is desired such that the total travel distance or the cost of transporting the jobs is minimized. If an application requires more than one identical machine, the cost is minimized by flow distributions between the machines. The problem of minimizing the travel distance that involves sets of identical machines is often formulated as a tertiary assignment problem. Finding an optimal solution for such a problem can be very complicated due to its combinatorial nature. This research proposes a two-stage solution methodology to ease the computation and to obtain a better solution. First, the problem of sets of identical machines is decomposed into sets of unique machines to find the machine assignment. Second, the task is to find the flow assignment by holding the machine assignment found in the previous stage. Results are encouraging and they are demonstrated through numerical examples and a set of test problems.

Item Type: Article
Subjects: T Technology > T Technology (General)
Depositing User: Ahmad Diponegoro
Date Deposited: 17 Aug 2020 04:56
Last Modified: 17 Aug 2020 04:56
URI: http://repository.uhamka.ac.id/id/eprint/1628

Actions (login required)

View Item View Item