eprintid: 1627
rev_number: 5
eprint_status: archive
userid: 1777
dir: disk0/00/00/16/27
datestamp: 2020-08-17 13:06:49
lastmod: 2020-08-17 13:06:49
status_changed: 2020-08-17 13:06:49
type: article
metadata_visibility: show
creators_name: Diponegoro, Ahmad
creators_name: Sarker, B R
creators_id: adipone@uhamka.ac.id
creators_orcid: 0000-0002-1436-250X
title: Machine assignment in a nonlinear multi-product flowline
ispublished: pub
subjects: T1
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.
date: 2003-05-29
date_type: published
publisher: Palgrave Macmillan UK
official_url: http://doi.org/10.1057/palgrave.jors.2601488
id_number: doi:10.1057/palgrave.jors.2601488
full_text_status: none
publication: Journal of the Operational Research Society
volume: 54
number: 5
pagerange: 472-489
refereed: TRUE
issn: 0160-5682
related_url_url: https://link.springer.com/article/10.1057/palgrave.jors.2601488
related_url_type: pub
citation:   Diponegoro, Ahmad dan Sarker, B R  (2003) Machine assignment in a nonlinear multi-product flowline.  Journal of the Operational Research Society, 54 (5).  pp. 472-489.  ISSN 0160-5682