A lexicographic approach to bi-objective loading of a flexible assembly system

The paper presents a bi-objective integer program and an approximative lexicographic approach for a bicriterion loading and routing problem in a flexible assembly system. The problem objective is to determine an allocation of tasks among the assembly stations for a set of products so as to balance s...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research Vol. 107; no. 3; pp. 656 - 668
Main Author: Sawik, Tadeusz
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 16.06.1998
Elsevier
Elsevier Sequoia S.A
Series:European Journal of Operational Research
Subjects:
Applied sciences
Computer science; control theory; systems
Control theory. Systems
Exact sciences and technology
Flexible manufacturing system
Flexible manufacturing systems
Integer programming
Inventory control, production control. Distribution
Lexicographic approach
Loading and routing
LP-based heuristic
Multiobjective integer programming
Operational research and scientific management
Operational research. Management science
Operations research
Process control. Computer integrated manufacturing
Studies
Workloads
Multiobjective integer programming
Flexible manufacturing system
Loading and routing
LP-based heuristic
Lexicographic approach
Integer programming
Network flow
Loading
Heuristic method
Multiobjective programming
Task scheduling
Routing
Linear programming
Assembly
ISSN:0377-2217, 1872-6860
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The paper presents a bi-objective integer program and an approximative lexicographic approach for a bicriterion loading and routing problem in a flexible assembly system. The problem objective is to determine an allocation of tasks among the assembly stations for a set of products so as to balance station workloads and minimize total interstation transfer time. In the approach proposed, first the station workloads are balanced using a linear relaxation-based heuristic and then assembly routes are selected based on a network flow model. An illustrative example is provided and some results of computational experiments are reported.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(97)00091-X