Skip to main content
SpringerLink
Log in

Collaborative production planning in a supply-chain network with partial information sharing

  • Original article
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

Manufacturing entities in a supply-chain network may face difficulties in coordinating themselves due to different organizational conventions, locally specific restrictions, and conflicting objectives. This paper focuses on the study of a collaborative decision paradigm for operational coordination among manufacturing facilities in manufacturing logistics network. The aim of this work is to propose a collaborative coordination mechanism that allows the distributed production system to perform just as well as a centralized one using the notion of collaborative agents. Two search methods incorporated in the coordination mechanism are investigated with various test scenarios under partial information sharing environment.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Jeong IJ, Leon VJ (2002) Decision-making and cooperative interaction via coupling agents in organizationally distributed systems. IIE Transactions–Special Issue on Large-Scale Optimization 34:789–802

    Google Scholar 

  2. Danzig GB, Wolfe P (1961) The decomposition algorithm for linear programs. Econometirc 29:767–778

    Article  Google Scholar 

  3. Roundy RD, Maxwell WL, Herer YT, Tayur SR, Getzler AW (1991) A price-directed approach to real-time scheduling of manufacturing operations. IIE Trans 23:149–160

    Article  Google Scholar 

  4. Kutanoglu E, Wu SD (1999) On combinatorial auction and Lagrangian relaxation for distributed resource scheduling. IIE Trans 31:813–826

    Google Scholar 

  5. Bender JR (1962) Partitioning procedure for solving mixed variables programming problems. Numer Math 4:238–252

    Article  MathSciNet  Google Scholar 

  6. Davis R, Smith RG (1983) Negotiation as a metaphor for distributed problem solving. Artif Intell 20:63–109

    Article  Google Scholar 

  7. Lin GY, Solberg JJ (1992) Integrated shop floor control using autonomous agents. IIE Trans 24:57–71

    Article  Google Scholar 

  8. Bertsekas DP (1988) The auction algorithm: a distributed relaxation method for the assignment problem. Ann Oper Res 14:15–123

    Article  MathSciNet  Google Scholar 

  9. Bertsekas DP (1990) The auction algorithm for assignment and other network flow problems: a tutorial. Interfaces 20:133–149

    Google Scholar 

  10. Bhatnagar R, Chandra P (1993) Models for multi-plant coordination. Eur J Oper Res 67:141–160

    Article  Google Scholar 

  11. Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manage Sci 34(3):391–401

    Article  MATH  MathSciNet  Google Scholar 

  12. Glover F (1989) Tabu search–Part I. ORSA J Comput 1:190–206

    MATH  MathSciNet  Google Scholar 

  13. Glover F (1990) Tabu search–Part II. ORSA J Comput 2:4–32

    MATH  Google Scholar 

  14. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671–680

    Article  MathSciNet  Google Scholar 

  15. Glover F, Laguna M (1997) Tabu search. Kluwer Academic Publishers, Boulder, CO

    MATH  Google Scholar 

  16. Laguna M, Barnes JW, Glover F (1991) Tabu search methods for single machine scheduling problems. J Intell Manuf 2:63–74

    Article  Google Scholar 

  17. Van Laarhoven PJM, Aarts EHL (1988) Simulated annealing: theory and application. D. Reidel Publishing Company, Holland

    Google Scholar 

  18. Matsuo H, Suh CJ, Sullivan RS (1989) A controlled search simulated annealing method for the single machine weighted tardiness problem. Ann Oper Res 21:85–108

    Article  MATH  MathSciNet  Google Scholar 

  19. Vakharia AJ, Chang Y (1990) A simulated annealing approach to scheduling a manufacturing cell. Nav Res Logist 30:559–577

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Information and Systems Engineering, College of Engineering, Sangmyung University, Cheonan, Chungnam, 330-720, South Korea

    Hyun Joon Shin

Authors
  1. Hyun Joon Shin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hyun Joon Shin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shin, H.J. Collaborative production planning in a supply-chain network with partial information sharing. Int J Adv Manuf Technol 34, 981–987 (2007). https://doi.org/10.1007/s00170-006-0664-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-006-0664-6

Keywords

Search

Navigation