Negotiations among clients and suppliers considering production schedules in dynamic supply chain

Yoshitaka Tanimizu, Masahiko Yamanaka, Koji Iwamura, Nobuhiro Sugimura

Research output: Contribution to conferencePaper

Abstract

This research deals with a dynamic supply chain model representing decision-making processes of individual clients and suppliers, and also negotiation processes among all clients and suppliers. In the model, suitable prices and delivery time are determined based on both the scheduling processes of the individual suppliers and the negotiation processes among the clients and the suppliers. The production scheduling process of the suppliers are newly considered in the model to deal with the trade-off between the prices and the delivery time. The effectiveness of the proposed model is verified through computational experiments from the viewpoints of the prices, the delivery time and the benefit of the suppliers.

Original languageEnglish
Pages391-396
Number of pages6
Publication statusPublished - 2005 Dec 1
Externally publishedYes
Event3rd International Conference on Leading Edge Manufacturing in 21st Century, LEM 2005 - Nagoya, Japan
Duration: 2005 Oct 192005 Oct 22

Other

Other3rd International Conference on Leading Edge Manufacturing in 21st Century, LEM 2005
CountryJapan
CityNagoya
Period05/10/1905/10/22

Keywords

  • Delivery time
  • Dynamic supply chain
  • Genetic algorithm
  • Negotiation
  • Price
  • Production schedule

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'Negotiations among clients and suppliers considering production schedules in dynamic supply chain'. Together they form a unique fingerprint.

  • Cite this

    Tanimizu, Y., Yamanaka, M., Iwamura, K., & Sugimura, N. (2005). Negotiations among clients and suppliers considering production schedules in dynamic supply chain. 391-396. Paper presented at 3rd International Conference on Leading Edge Manufacturing in 21st Century, LEM 2005, Nagoya, Japan.