关于「实践:一家工作室的一周与一份检验方案」,《工作室超售、储值浮存金与升单阶梯》给出的定量结论是什么?
结论:第八章把这些合成一周的经营与一份检验方案,并给出一份清单。书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。
数据口径:书中的客户、价格、比率与成本均为示意模型;全部计算由书中程序生成;本书不是财务、会计、法律或医疗建议,不对任何疗程或服务的效果作出主张。 第八章把这些合成一周的经营与一份检验方案,并给出一份清单。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库
| policy | waiting list | spare chairs |
|---|---|---|
| no deposit, no overbooking | 3200 | 3200 |
| no deposit, one extra a day | 3332 | 3332 |
| deposit 20 | 3802 | 3440 |
| deposit 20, crowding out | 3635 | 3289 |
| deposit 20 and one extra | 3153 | 2853 |
查看完整验算程序
# Chapter 8. p15: One week, five policies. Five days of 8 slots, price
# 100, bump cost 300, clients miss with probability p. A deposit of 20
# cuts p from 0.200 to 0.062 (p01), or only to 0.114 if it crowds out
# duty. A studio with a waiting list fills every slot whatever it asks;
# one with spare chairs loses bookings to the deposit at rate
# exp(-0.5 d / 100). Exact binomial; no sampling. Weekly takings.
from math import comb, exp
S, DAYS, PRICE, BUMP, DEP = 8, 5, 100.0, 300.0, 20.0
def day(n, p, d, booked_share=1.0):
tot = 0.0
for a in range(n + 1):
pr = comb(n, a) * (1 - p) ** a * p ** (n - a)
tot += pr * (PRICE * min(a, S) - BUMP * max(a - S, 0) +
d * (n - a))
return tot * booked_share
if __name__ == "__main__":
share = exp(-0.5 * DEP / PRICE)
rows = (("no deposit, no overbooking", S, 0.200, 0.0, 1.0),
("no deposit, one extra a day", S + 1, 0.200, 0.0, 1.0),
("deposit 20", S, 0.062, DEP, share),
("deposit 20, crowding out", S, 0.114, DEP, share),
("deposit 20 and one extra", S + 1, 0.062, DEP, share))
print(" policy waiting list spare chairs")
for name, n, p, d, sh in rows:
print(" {:28s} {:12.0f} {:12.0f}".format(
name, DAYS * day(n, p, d), DAYS * day(n, p, d, sh)))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《预约制工作室超售排队、储值沉淀资金池与高客单升单阶梯》第 8 章「实践:一家工作室的一周与一份检验方案」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-107 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026107,
author = {Fan, Yafu},
title = {Appointment Studio Overbooking Queues, Prepaid Float Dynamics and High-Ticket Ascension Ladders},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}