Complexity of sequencing tasks in assembly cells attended by one or two robots

Wilbert E. Wilhelm

Naval Research Logistics (NRL), 1987, vol. 34, issue 5, 721-738

Abstract: This article develops a structure by which the computational complexity of sequencing problems in assembly cells attended by one or two robots may be evaluated. A taxonomy of cell features that affect complexity is developed, polynomial‐time algorithms are presented for certain problems, and borderline designs at which complexity changes dramatically are identified. Results will aid cell designers by indicating classes of designs for which task sequence may be optimized and other classes for which this cannot be done. Designs which entail features that lead to intractable sequencing problems may be modified to maximize cell productivity.

Date: 1987
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(198710)34:53.0.CO;2-H

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:34:y:1987:i:5:p:721-738

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().