Auction-theoretic coordination of production planning in the supply chain

Most planning and optimization methods in manufacturing logistics assume centralized or hierarchical decision-making using monolithic models. Motivated by the increasing needs to coordinate diverse decision processes and systems, we investigate an auction-theoretic mechanism for production coordination in a supply chain. Our effort focuses on structural mappings between mathematical decomposition and iterative auction mechanisms wherein agents compete based on their local utilities, announced conflict pricing, and production targets. Building upon the rich literature in optimization and auction-theoretic analysis, we investigate the advantages and limitations of this distributed decision scheme on a large set problem in supply chain production planning. Experimental results show that the proposed auction mechanism provides impressive improvement over the traditional monolithic method without significant degradation to the solution quality.

[1]  J. Banks,et al.  Allocating Uncertain and Unresponsive Resources , 1988 .

[2]  Luk N. Van Wassenhove,et al.  A simple heuristic for the multi item single level capacitated lotsizing problem , 1986 .

[3]  R. McAfee,et al.  Auctions and Bidding , 1986 .

[4]  L. V. Wassenhove,et al.  Multilevel capacitated lotsizing complexity and LP-based heuristics , 1991 .

[5]  J. Banks,et al.  Allocating uncertain and unresponsive resources: an experimental approach. , 1989, The Rand journal of economics.

[6]  S. Rassenti,et al.  A Combinatorial Auction Mechanism for Airport Time Slot Allocation , 1982 .

[7]  H. Tempelmeier,et al.  A Lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times , 1996 .

[8]  Luk N. Van Wassenhove,et al.  Capacitated dynamic lotsizing heuristics for serial systems , 1991 .

[9]  Horst Tempelmeier,et al.  A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures , 1994 .

[10]  L. J. Thomas,et al.  Heuristics for multilevel lot-sizing with a bottleneck , 1986 .

[11]  Laurence A. Wolsey,et al.  Multi-item lot-sizing problems using strong cutting planes , 1991 .

[12]  Yaakov Roll,et al.  Multi-item, multi-level lot sizing with an aggregate capacity constraint , 1991 .

[13]  S. David Wu,et al.  On combinatorial auction and Lagrangean relaxation for distributed resource scheduling , 1999 .

[14]  S. Goyal,et al.  Models for multi-plant coordination , 1993 .

[15]  Robert H. Storer,et al.  Manufacturing logistics research: taxonomy and directions , 1999 .

[16]  Marc Salomon,et al.  LINEAR PROGRAMMING, SIMULATED ANNEALING AND TABU SEARCH HEURISTICS FOR LOTSIZING IN BOTTLENECK ASSEMBLY SYSTEMS , 1993 .

[17]  Hartmut Stadtler,et al.  Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing , 1996 .

[18]  Anthony J. Zahorik,et al.  Network Programming Models for Production Scheduling in Multi-Stage, Multi-Item Capacitated Systems , 1984 .

[19]  Monique Guignard-Spielberg,et al.  Lagrangean decomposition: A model yielding stronger lagrangean bounds , 1987, Math. Program..