We apply combinatorial auction as a coordination mechanism to smooth demands placed on suppliers' limited production capacities, allowing several manufacturers to share common suppliers effectively. Products are bidders bidding for parts from suppliers, consuming their capacities in different time periods. The fourth party logistic (4PL) provider acts as the auctioneer to coordinate bids and perform price iterations. We leverage on the strong links between the Lagrangian relaxation method and combinatorial auction, where the Lagrange multipliers serve as the supply capacity reserve prices, to balance the demand and supply of capacities. To prevent cyclic behaviour and to increase convergence speed, we introduce a non-linear capacity cost component to the sub-problems' objective function. In addition, our formulation permits asynchronous bidding, allowing dynamic changes in production demand and capacity supply, making the model applicable in actual industry setting. Our experimental results suggest the suitability of three different price revision methods for different problem types.
Computer Sciences | Operations and Supply Chain Management | Operations Research, Systems Engineering and Industrial Engineering
Intelligent Systems and Decision Analytics
International Journal of Industrial and System Engineering
International Journal of Engineering and Technology
LEONG, Thin Yin and CHEONG, Michelle Lee Fong.
Multi-Party Multi-Period Supply Chain Coordination. (2012). International Journal of Industrial and System Engineering. 10, (3), 300-318. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1306
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.