An LP-based approach for loading and routing in a flexible assembly line

The paper presents integer programming formulations and a heuristic solution procedure for a bicriterion loading and assembly plan selection problem in a flexible assembly line. The problem objective is to simultaneously determine an allocation of assembly tasks among the stations and select assembl...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of production economics Jg. 64; H. 1; S. 49 - 58
1. Verfasser: Sawik, Tadeusz
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 01.03.2000
Elsevier
Elsevier Sequoia S.A
Schriftenreihe:International Journal of Production Economics
Schlagworte:
Assembly lines
Bi-objective integer programming
Flexible manufacturing systems
Heuristic
Integer programming
Loading
LP-based heuristic
Production planning
Routing
Studies
Bi-objective integer programming
Routing
Loading
Flexible manufacturing systems
LP-based heuristic
ISSN:0925-5273, 1873-7579
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The paper presents integer programming formulations and a heuristic solution procedure for a bicriterion loading and assembly plan selection problem in a flexible assembly line. The problem objective is to simultaneously determine an allocation of assembly tasks among the stations and select assembly sequences and assembly routes for a mix of products so as to balance station workloads and to minimize total transportation time in a unidirectional flow system. In the approach proposed, first the station workloads are balanced using a linear relaxation-based heuristic and then assembly sequences and assembly routes are selected for all products, based on a network flow model. An illustrative example is provided and some computational results are reported.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0925-5273
1873-7579
DOI:10.1016/S0925-5273(99)00043-2