## 作业排程问题

### 问题描述

Automobile factory with two assembly lines(汽车厂两条装配线)

– Each line has n stations: S1,1, . . . , S1,n and S2,1, . . . , S2,n(每条装

– Corresponding stations S1, j and S2, j perform the same function

but can take different amounts of time a1, j and a2, j (每条装配线的

– Entry times e1 and e2 and exit times x1 and x2(上线和下线时间)

## 思考题

1. 动态规划算法范式是什么？

1. 利用动态规划算法设计方法解决矩阵链相乘问题？

Author: TankNee
Copyright Notice: All articles in this blog are licensed under CC BY-NC-SA 4.0 unless stating additionally.