TY  - JOUR
JF  - European Journal of Operational Research
Y1  - 2003///
A1  - Diponegoro, Ahmad
A1  - Sarker, Bhaba R.
N2  - 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.
ID  - repository1628
UR  - http://doi.org/10.1016/S0377-2217(02)00370-3
AV  - none
IS  - 3
TI  - Flow distance reduction for a multi-product flowline with sets of identical machines
EP  - 612
SP  - 591
SN  - 03772217
VL  - 147
ER  -