An agent-based negotiation model on price and delivery date in a fashion supply chain

DOI10.1007/s10479-013-1327-2zbMath1350.90011OpenAlexW2169878423MaRDI QIDQ324332

An Pan, Tsan-Ming Choi

Publication date: 11 October 2016

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-013-1327-2

zbMATH Keywords

simulated annealingnegotiationagent-based modelfashion supply chainprice-due-date negotiation

Mathematics Subject Classification ID

Noncooperative games (91A10) Sensitivity, stability, parametric optimization (90C31) Cooperative games (91A12) Transportation, logistics and supply chain management (90B06)

Related Items

Evolutionary algorithms for supply chain management, Stochastic Multi-Objectives Supply Chain Optimization with Forecasting Partial Backordering Rate: A Novel Hybrid Method of Meta Goal Programming and Evolutionary Algorithms, Mechanism design of fashion virtual enterprise under monitoring strategy, A robust optimization model for agile and build-to-order supply chain planning under uncertainties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Supply chain networks with global outsourcing and quick-response production under demand and cost uncertainty
• Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection
• A simultaneous multi-issue negotiation through autonomous agents
• Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective
• Minimizing customer order lead-time in a two-stage assembly supply chain
• Survey of scheduling research involving due date determination decisions
• Pricing and lead time decisions for make-to-order firms with contingent orders
• Metaheuristics: A bibliography
• Distributed personnel scheduling -- negotiation among scheduling agents
• A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines
• Due Date Assignment for Production Systems
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
• Integrated model for supplier selection and negotiation in a make-to-order environment