Innovative Priority Mechanisms in Service Operations : : Theory and Applications.

Saved in:
Bibliographic Details
Superior document:SpringerBriefs in Service Science Series
:
TeilnehmendeR:
Place / Publishing House:Cham : : Springer International Publishing AG,, 2023.
Ã2023.
Year of Publication:2023
Edition:1st ed.
Language:English
Series:SpringerBriefs in Service Science Series
Online Access:
Physical Description:1 online resource (148 pages)
Tags: Add Tag
No Tags, Be the first to tag this record!
id 50030606106
ctrlnum (MiAaPQ)50030606106
(Au-PeEL)EBL30606106
(OCoLC)1386705704
collection bib_alma
record_format marc
spelling Cui, Shiliang.
Innovative Priority Mechanisms in Service Operations : Theory and Applications.
1st ed.
Cham : Springer International Publishing AG, 2023.
Ã2023.
1 online resource (148 pages)
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
SpringerBriefs in Service Science Series
Intro -- Preface -- Contents -- 1 A Brief Review of Research on Priority Queues with Self-Interested Customers -- 1 Introduction -- 2 Unobservable Queues -- 2.1 Priority Pricing -- 2.2 Priority Auctions -- 3 Observable Queues -- 4 Emerging Research Directions -- References -- 2 Auctions for Trading Queueing Positions -- 1 Introduction -- 2 Model Setup -- 3 Baseline Auction -- 3.1 Trading Rules -- 3.2 Auction Equilibrium -- 4 Social Welfare and Service Provider's Revenue -- 4.1 Social Optimization -- 4.2 Service Provider's Revenue Maximization -- 5 Trading Through an Intermediary -- 5.1 Baseline Auction with a Trade Participation Fee -- 5.2 Augmented Auction: Trading Rulesand a Motivating Example -- 5.3 Auction Equilibrium -- 5.4 Optimal Auction Parameters and Structure -- 5.5 The Value of Trading vs. FIFO -- 6 Conclusion Remarks -- References -- 3 Line-Sitting Services -- 1 Introduction -- 2 Model Preliminaries and FIFO Benchmark -- 2.1 FIFO Benchmark -- 3 Line-Sitting -- 3.1 Comparison Between Line-Sitting and FIFO -- 4 Accommodating Line-Sitting or Selling Priority? -- 4.1 Priority Purchasing -- 4.2 Comparison Between Priority and FIFO -- 4.3 Comparison Between Line-Sitting and Priority -- 5 Three-Way Comparison -- 6 Endogenizing Service Fee B -- 7 Finitely Many Line-Sitters -- 8 Pre-commitment Payment -- 8.1 Revenue of the Line-Sitting Firm -- 8.2 Welfare Implications -- 9 Concluding Remarks -- References -- 4 Queue Scalping -- 1 Introduction -- 2 Model Description -- 3 Analysis of the Single-Scalper Model -- 3.1 What Queues Are Susceptible to Scalping? -- 4 Analysis of the Multi-Scalper Model -- 4.1 What Queues Are Susceptible to Scalping? -- 5 Impact of Queue-Scalping -- 5.1 System Throughput -- 5.2 Consumer Surplus -- 5.3 Social Welfare -- 6 The Long-Run Capacity Response -- 7 Comparison with Line-Sitting -- 8 Effect of Queue Information.
9 Concluding Remarks -- References -- 5 Referral Priority Programs -- 1 Introduction -- 2 Model -- 2.1 Queueing Preliminaries -- 3 Equilibrium -- 3.1 Equilibrium Referral Strategies -- 3.2 Existence of Equilibria and Structural Results -- 4 Effectiveness of the Referral Priority Program -- 4.1 Analytic Results -- 4.1.1 System Throughput -- 4.1.2 Customer Welfare -- 4.2 Summary -- 5 Extensions -- 6 Optimal Pricing, Referral Reward Program, and Comparison -- 6.1 Pricing in the Referral Reward Program -- 6.2 Numerical Comparison -- 7 Optimal Scheduling in Referral Priority Programs -- 7.1 Numerical Illustrations -- 7.2 Capacity Implications -- 8 Concluding Remarks -- References -- 6 Distance-Based Service Priority -- 1 Introduction -- 2 Model Preliminaries and FIFO Benchmark -- 2.1 FIFO Service Discipline -- 3 Distance-Based Service Priority Policy -- 4 Comparison between Priority and FIFO Policies -- 5 Two-Dimensional Service Area -- 6 Optimal Service Fee B -- 7 Comparison to Price Discrimination Strategy -- 7.1 Comparing PDS to the FIFO Benchmark -- 7.2 Comparing PDS to the Priority Policy -- 8 Concluding Remarks -- References -- 7 In-Queue Priority Purchase -- 1 Introduction -- 2 Model Description -- 3 Simultaneous Upgrade Rule -- 3.1 Equilibrium Definition -- 3.2 Analysis -- 3.2.1 Step 1: Equilibrium Structure -- 3.2.2 Step 2: Nonexistence of Pure-Strategy Equilibria -- 3.3 A Small Buffer System -- 4 Sequential Upgrade Rule -- 4.1 Equilibrium Definition -- 4.2 Sufficiently Light or Heavy Traffic -- 4.3 Small Buffer Systems -- 4.3.1 K=2 -- 4.3.2 K=3 -- 5 Concluding Remarks -- References.
Description based on publisher supplied metadata and other sources.
Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.
Electronic books.
Wang, Zhongbin.
Yang, Luyi.
Print version: Cui, Shiliang Innovative Priority Mechanisms in Service Operations Cham : Springer International Publishing AG,c2023 9783031308406
ProQuest (Firm)
https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=30606106 Click to View
language English
format eBook
author Cui, Shiliang.
spellingShingle Cui, Shiliang.
Innovative Priority Mechanisms in Service Operations : Theory and Applications.
SpringerBriefs in Service Science Series
Intro -- Preface -- Contents -- 1 A Brief Review of Research on Priority Queues with Self-Interested Customers -- 1 Introduction -- 2 Unobservable Queues -- 2.1 Priority Pricing -- 2.2 Priority Auctions -- 3 Observable Queues -- 4 Emerging Research Directions -- References -- 2 Auctions for Trading Queueing Positions -- 1 Introduction -- 2 Model Setup -- 3 Baseline Auction -- 3.1 Trading Rules -- 3.2 Auction Equilibrium -- 4 Social Welfare and Service Provider's Revenue -- 4.1 Social Optimization -- 4.2 Service Provider's Revenue Maximization -- 5 Trading Through an Intermediary -- 5.1 Baseline Auction with a Trade Participation Fee -- 5.2 Augmented Auction: Trading Rulesand a Motivating Example -- 5.3 Auction Equilibrium -- 5.4 Optimal Auction Parameters and Structure -- 5.5 The Value of Trading vs. FIFO -- 6 Conclusion Remarks -- References -- 3 Line-Sitting Services -- 1 Introduction -- 2 Model Preliminaries and FIFO Benchmark -- 2.1 FIFO Benchmark -- 3 Line-Sitting -- 3.1 Comparison Between Line-Sitting and FIFO -- 4 Accommodating Line-Sitting or Selling Priority? -- 4.1 Priority Purchasing -- 4.2 Comparison Between Priority and FIFO -- 4.3 Comparison Between Line-Sitting and Priority -- 5 Three-Way Comparison -- 6 Endogenizing Service Fee B -- 7 Finitely Many Line-Sitters -- 8 Pre-commitment Payment -- 8.1 Revenue of the Line-Sitting Firm -- 8.2 Welfare Implications -- 9 Concluding Remarks -- References -- 4 Queue Scalping -- 1 Introduction -- 2 Model Description -- 3 Analysis of the Single-Scalper Model -- 3.1 What Queues Are Susceptible to Scalping? -- 4 Analysis of the Multi-Scalper Model -- 4.1 What Queues Are Susceptible to Scalping? -- 5 Impact of Queue-Scalping -- 5.1 System Throughput -- 5.2 Consumer Surplus -- 5.3 Social Welfare -- 6 The Long-Run Capacity Response -- 7 Comparison with Line-Sitting -- 8 Effect of Queue Information.
9 Concluding Remarks -- References -- 5 Referral Priority Programs -- 1 Introduction -- 2 Model -- 2.1 Queueing Preliminaries -- 3 Equilibrium -- 3.1 Equilibrium Referral Strategies -- 3.2 Existence of Equilibria and Structural Results -- 4 Effectiveness of the Referral Priority Program -- 4.1 Analytic Results -- 4.1.1 System Throughput -- 4.1.2 Customer Welfare -- 4.2 Summary -- 5 Extensions -- 6 Optimal Pricing, Referral Reward Program, and Comparison -- 6.1 Pricing in the Referral Reward Program -- 6.2 Numerical Comparison -- 7 Optimal Scheduling in Referral Priority Programs -- 7.1 Numerical Illustrations -- 7.2 Capacity Implications -- 8 Concluding Remarks -- References -- 6 Distance-Based Service Priority -- 1 Introduction -- 2 Model Preliminaries and FIFO Benchmark -- 2.1 FIFO Service Discipline -- 3 Distance-Based Service Priority Policy -- 4 Comparison between Priority and FIFO Policies -- 5 Two-Dimensional Service Area -- 6 Optimal Service Fee B -- 7 Comparison to Price Discrimination Strategy -- 7.1 Comparing PDS to the FIFO Benchmark -- 7.2 Comparing PDS to the Priority Policy -- 8 Concluding Remarks -- References -- 7 In-Queue Priority Purchase -- 1 Introduction -- 2 Model Description -- 3 Simultaneous Upgrade Rule -- 3.1 Equilibrium Definition -- 3.2 Analysis -- 3.2.1 Step 1: Equilibrium Structure -- 3.2.2 Step 2: Nonexistence of Pure-Strategy Equilibria -- 3.3 A Small Buffer System -- 4 Sequential Upgrade Rule -- 4.1 Equilibrium Definition -- 4.2 Sufficiently Light or Heavy Traffic -- 4.3 Small Buffer Systems -- 4.3.1 K=2 -- 4.3.2 K=3 -- 5 Concluding Remarks -- References.
author_facet Cui, Shiliang.
Wang, Zhongbin.
Yang, Luyi.
author_variant s c sc
author2 Wang, Zhongbin.
Yang, Luyi.
author2_variant z w zw
l y ly
author2_role TeilnehmendeR
TeilnehmendeR
author_sort Cui, Shiliang.
title Innovative Priority Mechanisms in Service Operations : Theory and Applications.
title_sub Theory and Applications.
title_full Innovative Priority Mechanisms in Service Operations : Theory and Applications.
title_fullStr Innovative Priority Mechanisms in Service Operations : Theory and Applications.
title_full_unstemmed Innovative Priority Mechanisms in Service Operations : Theory and Applications.
title_auth Innovative Priority Mechanisms in Service Operations : Theory and Applications.
title_new Innovative Priority Mechanisms in Service Operations :
title_sort innovative priority mechanisms in service operations : theory and applications.
series SpringerBriefs in Service Science Series
series2 SpringerBriefs in Service Science Series
publisher Springer International Publishing AG,
publishDate 2023
physical 1 online resource (148 pages)
edition 1st ed.
contents Intro -- Preface -- Contents -- 1 A Brief Review of Research on Priority Queues with Self-Interested Customers -- 1 Introduction -- 2 Unobservable Queues -- 2.1 Priority Pricing -- 2.2 Priority Auctions -- 3 Observable Queues -- 4 Emerging Research Directions -- References -- 2 Auctions for Trading Queueing Positions -- 1 Introduction -- 2 Model Setup -- 3 Baseline Auction -- 3.1 Trading Rules -- 3.2 Auction Equilibrium -- 4 Social Welfare and Service Provider's Revenue -- 4.1 Social Optimization -- 4.2 Service Provider's Revenue Maximization -- 5 Trading Through an Intermediary -- 5.1 Baseline Auction with a Trade Participation Fee -- 5.2 Augmented Auction: Trading Rulesand a Motivating Example -- 5.3 Auction Equilibrium -- 5.4 Optimal Auction Parameters and Structure -- 5.5 The Value of Trading vs. FIFO -- 6 Conclusion Remarks -- References -- 3 Line-Sitting Services -- 1 Introduction -- 2 Model Preliminaries and FIFO Benchmark -- 2.1 FIFO Benchmark -- 3 Line-Sitting -- 3.1 Comparison Between Line-Sitting and FIFO -- 4 Accommodating Line-Sitting or Selling Priority? -- 4.1 Priority Purchasing -- 4.2 Comparison Between Priority and FIFO -- 4.3 Comparison Between Line-Sitting and Priority -- 5 Three-Way Comparison -- 6 Endogenizing Service Fee B -- 7 Finitely Many Line-Sitters -- 8 Pre-commitment Payment -- 8.1 Revenue of the Line-Sitting Firm -- 8.2 Welfare Implications -- 9 Concluding Remarks -- References -- 4 Queue Scalping -- 1 Introduction -- 2 Model Description -- 3 Analysis of the Single-Scalper Model -- 3.1 What Queues Are Susceptible to Scalping? -- 4 Analysis of the Multi-Scalper Model -- 4.1 What Queues Are Susceptible to Scalping? -- 5 Impact of Queue-Scalping -- 5.1 System Throughput -- 5.2 Consumer Surplus -- 5.3 Social Welfare -- 6 The Long-Run Capacity Response -- 7 Comparison with Line-Sitting -- 8 Effect of Queue Information.
9 Concluding Remarks -- References -- 5 Referral Priority Programs -- 1 Introduction -- 2 Model -- 2.1 Queueing Preliminaries -- 3 Equilibrium -- 3.1 Equilibrium Referral Strategies -- 3.2 Existence of Equilibria and Structural Results -- 4 Effectiveness of the Referral Priority Program -- 4.1 Analytic Results -- 4.1.1 System Throughput -- 4.1.2 Customer Welfare -- 4.2 Summary -- 5 Extensions -- 6 Optimal Pricing, Referral Reward Program, and Comparison -- 6.1 Pricing in the Referral Reward Program -- 6.2 Numerical Comparison -- 7 Optimal Scheduling in Referral Priority Programs -- 7.1 Numerical Illustrations -- 7.2 Capacity Implications -- 8 Concluding Remarks -- References -- 6 Distance-Based Service Priority -- 1 Introduction -- 2 Model Preliminaries and FIFO Benchmark -- 2.1 FIFO Service Discipline -- 3 Distance-Based Service Priority Policy -- 4 Comparison between Priority and FIFO Policies -- 5 Two-Dimensional Service Area -- 6 Optimal Service Fee B -- 7 Comparison to Price Discrimination Strategy -- 7.1 Comparing PDS to the FIFO Benchmark -- 7.2 Comparing PDS to the Priority Policy -- 8 Concluding Remarks -- References -- 7 In-Queue Priority Purchase -- 1 Introduction -- 2 Model Description -- 3 Simultaneous Upgrade Rule -- 3.1 Equilibrium Definition -- 3.2 Analysis -- 3.2.1 Step 1: Equilibrium Structure -- 3.2.2 Step 2: Nonexistence of Pure-Strategy Equilibria -- 3.3 A Small Buffer System -- 4 Sequential Upgrade Rule -- 4.1 Equilibrium Definition -- 4.2 Sufficiently Light or Heavy Traffic -- 4.3 Small Buffer Systems -- 4.3.1 K=2 -- 4.3.2 K=3 -- 5 Concluding Remarks -- References.
isbn 9783031308413
9783031308406
callnumber-first H - Social Science
callnumber-subject HD - Industries, Land Use, Labor
callnumber-label HD9980-9990
callnumber-sort HD 49980 49990
genre Electronic books.
genre_facet Electronic books.
url https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=30606106
illustrated Not Illustrated
oclc_num 1386705704
work_keys_str_mv AT cuishiliang innovativeprioritymechanismsinserviceoperationstheoryandapplications
AT wangzhongbin innovativeprioritymechanismsinserviceoperationstheoryandapplications
AT yangluyi innovativeprioritymechanismsinserviceoperationstheoryandapplications
status_str n
ids_txt_mv (MiAaPQ)50030606106
(Au-PeEL)EBL30606106
(OCoLC)1386705704
carrierType_str_mv cr
hierarchy_parent_title SpringerBriefs in Service Science Series
is_hierarchy_title Innovative Priority Mechanisms in Service Operations : Theory and Applications.
container_title SpringerBriefs in Service Science Series
author2_original_writing_str_mv noLinkedField
noLinkedField
marc_error Info : Unimarc and ISO-8859-1 translations identical, choosing ISO-8859-1. --- [ 856 : z ]
_version_ 1792331070931206144
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05202nam a22004333i 4500</leader><controlfield tag="001">50030606106</controlfield><controlfield tag="003">MiAaPQ</controlfield><controlfield tag="005">20240229073850.0</controlfield><controlfield tag="006">m o d | </controlfield><controlfield tag="007">cr cnu||||||||</controlfield><controlfield tag="008">240229s2023 xx o ||||0 eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783031308413</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9783031308406</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MiAaPQ)50030606106</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(Au-PeEL)EBL30606106</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1386705704</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">MiAaPQ</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="e">pn</subfield><subfield code="c">MiAaPQ</subfield><subfield code="d">MiAaPQ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">HD9980-9990</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cui, Shiliang.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Innovative Priority Mechanisms in Service Operations :</subfield><subfield code="b">Theory and Applications.</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham :</subfield><subfield code="b">Springer International Publishing AG,</subfield><subfield code="c">2023.</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">Ã2023.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (148 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">SpringerBriefs in Service Science Series</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Intro -- Preface -- Contents -- 1 A Brief Review of Research on Priority Queues with Self-Interested Customers -- 1 Introduction -- 2 Unobservable Queues -- 2.1 Priority Pricing -- 2.2 Priority Auctions -- 3 Observable Queues -- 4 Emerging Research Directions -- References -- 2 Auctions for Trading Queueing Positions -- 1 Introduction -- 2 Model Setup -- 3 Baseline Auction -- 3.1 Trading Rules -- 3.2 Auction Equilibrium -- 4 Social Welfare and Service Provider's Revenue -- 4.1 Social Optimization -- 4.2 Service Provider's Revenue Maximization -- 5 Trading Through an Intermediary -- 5.1 Baseline Auction with a Trade Participation Fee -- 5.2 Augmented Auction: Trading Rulesand a Motivating Example -- 5.3 Auction Equilibrium -- 5.4 Optimal Auction Parameters and Structure -- 5.5 The Value of Trading vs. FIFO -- 6 Conclusion Remarks -- References -- 3 Line-Sitting Services -- 1 Introduction -- 2 Model Preliminaries and FIFO Benchmark -- 2.1 FIFO Benchmark -- 3 Line-Sitting -- 3.1 Comparison Between Line-Sitting and FIFO -- 4 Accommodating Line-Sitting or Selling Priority? -- 4.1 Priority Purchasing -- 4.2 Comparison Between Priority and FIFO -- 4.3 Comparison Between Line-Sitting and Priority -- 5 Three-Way Comparison -- 6 Endogenizing Service Fee B -- 7 Finitely Many Line-Sitters -- 8 Pre-commitment Payment -- 8.1 Revenue of the Line-Sitting Firm -- 8.2 Welfare Implications -- 9 Concluding Remarks -- References -- 4 Queue Scalping -- 1 Introduction -- 2 Model Description -- 3 Analysis of the Single-Scalper Model -- 3.1 What Queues Are Susceptible to Scalping? -- 4 Analysis of the Multi-Scalper Model -- 4.1 What Queues Are Susceptible to Scalping? -- 5 Impact of Queue-Scalping -- 5.1 System Throughput -- 5.2 Consumer Surplus -- 5.3 Social Welfare -- 6 The Long-Run Capacity Response -- 7 Comparison with Line-Sitting -- 8 Effect of Queue Information.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">9 Concluding Remarks -- References -- 5 Referral Priority Programs -- 1 Introduction -- 2 Model -- 2.1 Queueing Preliminaries -- 3 Equilibrium -- 3.1 Equilibrium Referral Strategies -- 3.2 Existence of Equilibria and Structural Results -- 4 Effectiveness of the Referral Priority Program -- 4.1 Analytic Results -- 4.1.1 System Throughput -- 4.1.2 Customer Welfare -- 4.2 Summary -- 5 Extensions -- 6 Optimal Pricing, Referral Reward Program, and Comparison -- 6.1 Pricing in the Referral Reward Program -- 6.2 Numerical Comparison -- 7 Optimal Scheduling in Referral Priority Programs -- 7.1 Numerical Illustrations -- 7.2 Capacity Implications -- 8 Concluding Remarks -- References -- 6 Distance-Based Service Priority -- 1 Introduction -- 2 Model Preliminaries and FIFO Benchmark -- 2.1 FIFO Service Discipline -- 3 Distance-Based Service Priority Policy -- 4 Comparison between Priority and FIFO Policies -- 5 Two-Dimensional Service Area -- 6 Optimal Service Fee B -- 7 Comparison to Price Discrimination Strategy -- 7.1 Comparing PDS to the FIFO Benchmark -- 7.2 Comparing PDS to the Priority Policy -- 8 Concluding Remarks -- References -- 7 In-Queue Priority Purchase -- 1 Introduction -- 2 Model Description -- 3 Simultaneous Upgrade Rule -- 3.1 Equilibrium Definition -- 3.2 Analysis -- 3.2.1 Step 1: Equilibrium Structure -- 3.2.2 Step 2: Nonexistence of Pure-Strategy Equilibria -- 3.3 A Small Buffer System -- 4 Sequential Upgrade Rule -- 4.1 Equilibrium Definition -- 4.2 Sufficiently Light or Heavy Traffic -- 4.3 Small Buffer Systems -- 4.3.1 K=2 -- 4.3.2 K=3 -- 5 Concluding Remarks -- References.</subfield></datafield><datafield tag="588" ind1=" " ind2=" "><subfield code="a">Description based on publisher supplied metadata and other sources.</subfield></datafield><datafield tag="590" ind1=" " ind2=" "><subfield code="a">Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries. </subfield></datafield><datafield tag="655" ind1=" " ind2="4"><subfield code="a">Electronic books.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Zhongbin.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yang, Luyi.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Cui, Shiliang</subfield><subfield code="t">Innovative Priority Mechanisms in Service Operations</subfield><subfield code="d">Cham : Springer International Publishing AG,c2023</subfield><subfield code="z">9783031308406</subfield></datafield><datafield tag="797" ind1="2" ind2=" "><subfield code="a">ProQuest (Firm)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">SpringerBriefs in Service Science Series</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=30606106</subfield><subfield code="z">Click to View</subfield></datafield></record></collection>