Generic negotiation mechanisms with side payments -- design, analysis and application for decentralized resource-constrained multi-project scheduling problems
type: Item
instance of: scholarly article
title: Generic negotiation mechanisms with side payments -- design, analysis and application for decentralized resource-constrained multi-project scheduling problems
zbMATH Open document ID: 1403.90334
author: Jörg Homberger
author: Andreas Fink
published in: European Journal of Operational Research
publication date: 2018-05-29T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 91B06
Mathematics Subject Classification ID: 91B10
Mathematics Subject Classification ID: 91B26
zbMATH DE Number: 6875918
zbMATH Keywords: group decisions and negotiations
zbMATH Keywords: side payments
zbMATH Keywords: project scheduling
describes a project that uses: PSPLIB
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.03.022
OpenAlex ID: W2599555856
cites work: Scheduling subject to resource constraints: Classification and complexity
cites work: Negotiation-based collaborative planning between supply chains partners
cites work: Negotiation-based collaborative planning in divergent two-tier supply chains
cites work: Multiagent-based supply chain management
cites work: Secure and efficient protocols for multiple interdependent issues negotiation
cites work: Constructive and blocking power in collaborative transportation
cites work: A review on cost allocation methods in collaborative transportation
cites work: Project network models with discounted cash flows a guided tour through recent developments
cites work: Decentralized multi-level uncapacitated lot-sizing by automated negotiation
cites work: A \((\mu ,\, \lambda )\)-coordination mechanism for agent-based multi-project scheduling
cites work: A Branch and Bound Procedure for the Resource Constrained Project Scheduling Problem with Discounted Cash Flows
cites work: Maximizing the net present value of a project under resource constraints using a Lagrangian relaxation based heuristic with tight upper bounds
cites work: Experimental investigation of heuristics for resource-constrained project scheduling: an update
cites work: PSPLIB -- a project scheduling problem library
cites work: Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling
cites work: A decentralized model for automated multi-attribute negotiations with incomplete information and general utility functions
cites work: Exact and truncated branch-and-bound procedures for resource-constrained project scheduling with discounted cash flows and general temporal constraints.
cites work: Algorithmic Game Theory
cites work: A scatter search heuristic for maximising the net present value of a resource-constrained project with fixed activity cash flows
cites work: On Maximizing the Net Present Value of a Project Under Renewable Resource Constraints
DOI: 10.1016/J.EJOR.2017.03.022
description: scientific article; zbMATH DE number 6875918