A simple heuristic for linear sequencing of machines in layout design

This paper presents a simple heuristic to determine a common linear machine sequence for multiple products with different operation sequences and a limited number of duplicate machine types available for the job. The heuristic is based on minimisation of the total flow distance travelled by a produc...

Full description

Bibliographic Details
Main Authors: Kumar, M., Islam, Mohammad Nazrul, Lenin, N., Kumar, D., Ravingran, D.
Format: Journal Article
Published: Taylor and Francis 2010
Subjects:
Online Access:http://hdl.handle.net/20.500.11937/30273
_version_ 1848753041013997568
author Kumar, M.
Islam, Mohammad Nazrul
Lenin, N.
Kumar, D.
Ravingran, D.
author_facet Kumar, M.
Islam, Mohammad Nazrul
Lenin, N.
Kumar, D.
Ravingran, D.
author_sort Kumar, M.
building Curtin Institutional Repository
collection Online Access
description This paper presents a simple heuristic to determine a common linear machine sequence for multiple products with different operation sequences and a limited number of duplicate machine types available for the job. The heuristic is based on minimisation of the total flow distance travelled by a product on the linear machine sequence. It is assumed that the flows of products are allowed only in the forward direction, either in-sequence or by-pass. It is also assumed that backtrack movements are not allowed. The effectiveness of the proposed heuristic is demonstrated through the solutions of two typical layout design problems taken from the literature. Subsequently, a number of additional problems are solved and their results are compared with the results applying existing methods. The results indicate that the proposed method can be an effective tool in solving layout design problems.
first_indexed 2025-11-14T08:18:12Z
format Journal Article
id curtin-20.500.11937-30273
institution Curtin University Malaysia
institution_category Local University
last_indexed 2025-11-14T08:18:12Z
publishDate 2010
publisher Taylor and Francis
recordtype eprints
repository_type Digital Repository
spelling curtin-20.500.11937-302732017-09-13T16:08:23Z A simple heuristic for linear sequencing of machines in layout design Kumar, M. Islam, Mohammad Nazrul Lenin, N. Kumar, D. Ravingran, D. heuristics layout flow distance linear sequencing This paper presents a simple heuristic to determine a common linear machine sequence for multiple products with different operation sequences and a limited number of duplicate machine types available for the job. The heuristic is based on minimisation of the total flow distance travelled by a product on the linear machine sequence. It is assumed that the flows of products are allowed only in the forward direction, either in-sequence or by-pass. It is also assumed that backtrack movements are not allowed. The effectiveness of the proposed heuristic is demonstrated through the solutions of two typical layout design problems taken from the literature. Subsequently, a number of additional problems are solved and their results are compared with the results applying existing methods. The results indicate that the proposed method can be an effective tool in solving layout design problems. 2010 Journal Article http://hdl.handle.net/20.500.11937/30273 10.1080/00207543.2010.535860 Taylor and Francis fulltext
spellingShingle heuristics
layout
flow distance
linear sequencing
Kumar, M.
Islam, Mohammad Nazrul
Lenin, N.
Kumar, D.
Ravingran, D.
A simple heuristic for linear sequencing of machines in layout design
title A simple heuristic for linear sequencing of machines in layout design
title_full A simple heuristic for linear sequencing of machines in layout design
title_fullStr A simple heuristic for linear sequencing of machines in layout design
title_full_unstemmed A simple heuristic for linear sequencing of machines in layout design
title_short A simple heuristic for linear sequencing of machines in layout design
title_sort simple heuristic for linear sequencing of machines in layout design
topic heuristics
layout
flow distance
linear sequencing
url http://hdl.handle.net/20.500.11937/30273