Article ID: | iaor19992633 |
Country: | Netherlands |
Volume: | 107 |
Issue: | 3 |
Start Page Number: | 656 |
End Page Number: | 668 |
Publication Date: | Jun 1998 |
Journal: | European Journal of Operational Research |
Authors: | Sawik Tadeusz |
Keywords: | heuristics, programming: integer |
The paper presents a bi-objective integer program and an approximate 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.