代码
from pymprog import *
# 数据
# 星期 \ 轮班
a = [
(1, 0, 0, 1, 1, 1, 1),
(1, 1, 0, 0, 1, 1, 1),
(1, 1, 1, 0, 0, 1, 1),
(1, 1, 1, 1, 0, 0, 1),
(1, 1, 1, 1, 1, 0, 0),
(0, 1, 1, 1, 1, 1, 0),
(0, 0, 1, 1, 1, 1, 1)
]
# 需求人数
b = (20, 16, 13, 16, 19, 14, 12)
# 星期
c = {0: '星期一', 1: '星期二', 2: '星期三',3: '星期四', 4: '星期五', 5: '星期六', 6: '星期日'}
print("星期\轮班\n", a)
print("\n需求人数\n", b)
print("\n星期\n", c)
#模型及求解
begin('onduty')
x = var('x',len(a),kind=int) # 值班人数,决策变量
minimize(sum(x[i] for i in range(len(x))), '最少人数') # 目标函数
for i in range(len(x)): # 值班人数 >= 需求人数
sum(a[i][j]*x[j] for j in range(len(x))) >= b[i]
def report():
print("\n人员安排")
for i in range(len(x)):
if x[i].primal > 0.5: