Publication Type

Journal Article

Publication Date

2012

Abstract

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.

Discipline

Computer Sciences | Operations and Supply Chain Management | Operations Research, Systems Engineering and Industrial Engineering

Research Areas

Intelligent Systems and Decision Analytics

Publication

International Journal of Industrial and System Engineering

Volume

10

Issue

3

First Page

300

Last Page

318

ISSN

1748-5037

Identifier

10.1504/IJISE.2012.045677

Publisher

International Journal of Engineering and Technology

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Additional URL

http://dx.doi.org/10.1504/IJISE.2012.045677