Dual bounds of a service level assignment problem with applications to efficient pricing
type: Item
instance of: scholarly article
title: Dual bounds of a service level assignment problem with applications to efficient pricing
zbMATH Open document ID: 1403.90248
author: J. Michael Pavlin
published in: European Journal of Operational Research
publication date: 2018-05-30T00:00:00Z
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 6876518
zbMATH Keywords: service pricing
zbMATH Keywords: assignment
zbMATH Keywords: revenue management
zbMATH Keywords: priority queue
zbMATH Keywords: adaptive pricing
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.03.078
OpenAlex ID: W2604138123
cites work: Pricing and Priority Auctions in Queueing Systems with a Generalized Delay Cost Structure
cites work: Competition in Service Industries
cites work: Competition in Service Industries with Segmented Markets
cites work: Learning in nonlinear pricing with unknown utility functions
cites work: The auction algorithm: A distributed relaxation method for the assignment problem
cites work: An Auction Algorithm for Shortest Paths
cites work: The auction algorithm for the transportation problem
cites work: Revenue Optimization for a Make-to-Order Queue in an Uncertain Market Environment
cites work: The package assignment model.
cites work: A Characterization of Waiting Time Performance Realizable by Single-Server Queues
cites work: An adjustment scheme for nonlinear pricing problem with two buyers
cites work: The impact of the composition of the customer base in general queueing models
cites work: Characterization and Optimization of Achievable Performance in General Queueing Systems
cites work: Optimal Pricing That Coordinates Queues with Customer-Chosen Service Requirements
cites work: Rate control for communication networks: shadow prices, proportional fairness and stability
cites work: Optimum Bribing for Queue Position
cites work: Assignment Problems and the Location of Economic Activities
cites work: Pricing, Production, Scheduling, and Delivery-Time Competition
cites work: Priority Pricing
cites work: Monopoly and product quality
cites work: The Regulation of Queue Size by Levying Tolls
cites work: Q4739657
cites work: Stability and chaos in input pricing for a service facility with adaptive customer response to congestion
cites work: Evolutionary Implementation and Congestion Pricing
cites work: The assignment game. I: The core
cites work: Pricing and Capacity Decisions for a Service Facility: Stability and Multiple Local Optima
cites work: A Market-Based Approach to Optimal Resource Allocation in Integrated-Services Connection-Oriented Networks
cites work: Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
cites work: Price and Service Discrimination in Queuing Systems: Incentive Compatibility of Gcμ Scheduling
DOI: 10.1016/J.EJOR.2017.03.078
Recommended article: Lagrange dual bound computation for stochastic service network design
Recommended article: Formulating and Solving Service Network Pricing and Resource Allocation Games as Differential Variational Inequalities
Recommended article: An optimal constant level rationing policy under service level constraints
Recommended article: Stochastic programming bilevel models for service provision with a balancing coordinator
Recommended article: Optimal admission and pricing control problems in service industries with multiple servers and sideline profit
Recommended article: Pricing and Capacity Decisions for a Service Facility: Stability and Multiple Local Optima
Recommended article: Optimal admission and pricing control problem with deterministic service times and sideline profit
Recommended article: Optimal pricing and service capacity management for a matching queue problem with loss-averse customers
Recommended article: Approximate dynamic programming for capacity allocation in the service industry
description: scientific article; zbMATH DE number 6876518