@article{repository1627,
       publisher = {Palgrave Macmillan UK},
          number = {5},
           title = {Machine assignment in a nonlinear multi-product flowline},
          volume = {54},
           pages = {472--489},
           month = {May},
            year = {2003},
             doi = {doi:10.1057/palgrave.jors.2601488},
         journal = {Journal of the Operational Research Society},
            issn = {0160-5682},
          author = {Diponegoro, Ahmad and Sarker, B R},
             url = {http://doi.org/10.1057/palgrave.jors.2601488},
        abstract = {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.}
}