TITLE

PLANT LAYOUT: COMPUTERS VERSUS HUMANS

AUTHOR(S)
Coleman, Denis R.
PUB. DATE
September 1977
SOURCE
Management Science;Sep77, Vol. 24 Issue 1, p107
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
This work offers a critique of the methodology used by Scriabin and Vergin [7] in their study of computer algorithms versus humans in designing plant layouts. It attempts to show that Scriabin's and Vergin's experiments do not provide a useful comparison of computers and humans, and to point out several experimental procedures that would make comparisons of heuristic computer algorithms and humans more valid.
ACCESSION #
7348541

 

Related Articles

  • A NOTE ON "COMPARISON OF COMPUTER ALGORITHMS AND VISUAL BASED METHODS FOR PLANT LAYOUT" BY M. SCRIABIN AND R.C. VERGIN. Block, T.E. // Management Science;Oct77, Vol. 24 Issue 2, p235 

    This note recommends the use of flow dominance as a measure to determine the choice between computer algorithms and visual based methods for plant layout. It is suggested that plant layout problems with flow dominance close to or greater than 200% should be solved by visual based methods rather...

  • THE EFFICIENCY OF COMPUTER ALGORITHMS FOR PLANT LAYOUT. Ritzman, Larry P. // Management Science;Jan1972 Part 1, Vol. 18 Issue 5, p240 

    This paper presents the results of comparing experimentally the performance of four of the more promising computer algorithms for the plant layout problem. CDC 3600 computer programs are tested with twenty-six test problems. The resulting solutions are evaluated in respect to both computer time...

  • Instability in progressive multiple sequence alignment algorithms. Boyce, Kieran; Sievers, Fabian; Higgins, Desmond G. // Algorithms for Molecular Biology;10/9/2015, Vol. 10, p1 

    Background: Progressive alignment is the standard approach used to align large numbers of sequences. As with all heuristics, this involves a tradeoff between alignment accuracy and computation time. Results: We examine this tradeoff and find that, because of a loss of information in the early...

  • Heuristic identification of critical nodes in sparse real-world graphs. Pullan, Wayne // Journal of Heuristics;Oct2015, Vol. 21 Issue 5, p577 

    Given a graph, the critical node detection problem can be broadly defined as identifying the minimum subset of nodes such that, if these nodes were removed, some metric of graph connectivity is minimised. In this paper, two variants of the critical node detection problem are addressed. Firstly,...

  • New Traveling Salesman Problem Approximation Algorithm. Kendela, H. F.; Al-Ahmar, M. A.; El Horbaty, E.-S. M. // International Review on Computers & Software;Jul2007, Vol. 2 Issue 4, p325 

    The travelling salesman problem (TSP) has been studied by many researchers and a great variety of heuristics and implementations with varying solution quality/running time tradeoffs have been proposed. In this paper, we introduce a heuristic algorithm that uses nearest neighbour heuristic first...

  • Exploring an Approach Enhancing the Area Experts' Involvement in Layout Design and Improvement: an Empirical Experience. Chengbo Wang; Edgar, David // International MultiConference of Engineers & Computer Scientists;2009, p1661 

    This paper focuses on an empirical layout improvement project. In the implementation process of the project, the authors followed an enhanced procedure to increase the involvement of the area experts in the layout design process, which assured the successful realisation of an appropriate layout...

  • plant layout.  // Bloomsbury Business Library - Business & Management Dictionary;2007, p5713 

    A definition of the term plant layout is presented. It refers to the grouping of equipment and operations in a factory for the greatest degree of efficiency.

  • process layout.  // Bloomsbury Business Library - Business & Management Dictionary;2007, p5935 

    A definition of the term "process layout" is presented. It refers to a type of office or plant layout that groups together workstations or equipment that undertake similar processes.

  • Facility Layout to Support Just-in-Time. Kamoun, Mahdi; Yano, Candace Arai // Transportation Science;Nov96, Vol. 30 Issue 4, p315 

    In this paper, we develop a heuristic algorithm based on Benders' Decomposition to solve a version of the facility layout problem with decentralized shipping/receiving (s/r). Multiple s/r areas are allowed along the perimeter of the facility and each department can be serviced by the closest s/r...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics