TY  - JOUR
JF  - Journal of the Operational Research Society
Y1  - 2003/05/29/
A1  - Diponegoro, Ahmad
A1  - Sarker, B R
N2  - A group of 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 such that the total travel distance or the cost of transporting the jobs is minimized is desired. In this research, the assumption of a linear line with equally spaced machine location is relaxed. This research addressed problems of locating unique machines. It is found that the machine distances possess unique properties in this type of a problem. Utilizing these properties, heuristic strategies are proposed to obtain efficient solution where optimal methods are expected to be computationally prohibitive. A lower bound for the optimum solution is also proposed. Results are encouraging.
ID  - repository1627
UR  - http://doi.org/10.1057/palgrave.jors.2601488
AV  - none
IS  - 5
PB  - Palgrave Macmillan UK
TI  - Machine assignment in a nonlinear multi-product flowline
EP  - 489
SP  - 472
SN  - 0160-5682
VL  - 54
ER  -