Optimal Methodology for Synchronized Scheduling of Parallel Station Assembly with Air Transportation
Name
IMST019.pdf
Size
356.94 KB
Format
Adobe PDF
Checksum (MD5)
d8a2aedd5a23619d4b701087d4d38147
Author(s)
Ganesan, Viswanath Kumar
Li, Kungpeng
Appa Iyer, Sivakumar
Date Issued
January 2005
Series/Report no.
Innovation in Manufacturing Systems and Technology (IMST);
Abstract
We present an optimal methodology for synchronized scheduling of production assembly with air transportation to achieve accurate delivery with minimized cost in consumer electronics supply chain (CESC). This problem was motivated by a major PC manufacturer in consumer electronics industry, where it is required to schedule the delivery requirements to meet the customer needs in different parts of South East Asia. The overall problem is decomposed into two sub-problems which consist of an air transportation allocation problem and an assembly scheduling problem. The air transportation allocation problem is formulated as a Linear Programming Problem with earliness tardiness penalties for job orders. For the assembly scheduling problem, it is basically required to sequence the job orders on the assembly stations to minimize their waiting times before they are shipped by flights to their destinations. Hence the second sub-problem is modelled as a scheduling problem with earliness penalties. The earliness penalties are assumed to be independent of the job orders.
Subjects
Scheduling
Supply chain
Optimization
air transportation
Persistent DSpace Link
