A Time Window Constrained Order Allocation Problem for a Multi-Plant and Multi-Layer Serial Engineering Chain and GA-Based Solving Approaches
Date Issued
2008
Date
2008
Author(s)
Lin, His-Chieh
Abstract
This paper presents a time window constrained order allocation problem for a multi-plant and multi-layer serial engineering chain. A mathematical model for the problem was rigorously defined and two allocation strategies, cooperation and competition, with different goals were proposed and studied. Constraints on this problem include order completion times for each engineering layer, cross-layered product flow balance, transportation time, and production capacity. To comply with the layered structure of the engineering chain, an order-layer based GA encoding scheme was proposed, accompanying with order-layer divided crossover and mutation operations and a layer-nested decoding method, which deploys the final order allocation plan. The allocation plan reveals the numbers of products of different orders distributed to each time slot of all of the factories in each layer. Based on the two allocation strategies, three computation modes were proposed: order splitting under competition, order splitting under cooperation, and order competition. A prototype system implementing the proposed GA method was developed to test sample data. Benchmarks were designed based on layer scales and production and transportation cost variations. Numerical tests with various production scenarios showed that the proposed method can be used effectively to solve the presented problem, which will eventually facilitate engineering chain management.
Subjects
Time Window Constrained
Multi-Plant and Multi-Layer Serial Engineering Chain
Order Allocation Problem
Genetic Algorithm
SDGs
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-97-R95546027-1.pdf
Size
23.53 KB
Format
Adobe PDF
Checksum
(MD5):a0f8e5b26b702b33d383fc69209ae7b7