diff --git a/src/SUMMARY.md b/src/SUMMARY.md
index f196bf079..f29d8241f 100644
--- a/src/SUMMARY.md
+++ b/src/SUMMARY.md
@@ -407,5 +407,6 @@
     - [简易压缩算法/一种字符串压缩表示的解压 - 字符串](od/2024e200/compress-string/index.md)
     - [智能驾驶 - 二分查找](od/2024e200/intelligent-driving/index.md)
     - [字符串拼接 - 字符串](od/2024e200/merge-string/index.md)
+    - [项目排期 - DFS](od/2024e200/project-scheduling/index.md)
 
 [参考资料](refs.md)
diff --git a/src/od/2024e200/index.md b/src/od/2024e200/index.md
index 8dd4422ed..097e25177 100644
--- a/src/od/2024e200/index.md
+++ b/src/od/2024e200/index.md
@@ -23,3 +23,4 @@
 21. [简易压缩算法/一种字符串压缩表示的解压 - 字符串](compress-string/index.md)
 22. [智能驾驶 - 二分查找](intelligent-driving/index.md)
 23. [字符串拼接 - 字符串](merge-string/index.md)
+24. [项目排期 - DFS](project-scheduling/index.md)
\ No newline at end of file
diff --git a/src/od/2024e200/project-scheduling/Cargo.toml b/src/od/2024e200/project-scheduling/Cargo.toml
new file mode 100644
index 000000000..b983ddc0f
--- /dev/null
+++ b/src/od/2024e200/project-scheduling/Cargo.toml
@@ -0,0 +1,7 @@
+[package]
+name = "e200-project-scheduling"
+version = "0.1.0"
+edition = "2021"
+publish = false
+
+[dependencies]
diff --git a/src/od/2024e200/project-scheduling/assets/input1.txt b/src/od/2024e200/project-scheduling/assets/input1.txt
new file mode 100644
index 000000000..cbf4f6957
--- /dev/null
+++ b/src/od/2024e200/project-scheduling/assets/input1.txt
@@ -0,0 +1,2 @@
+6 2 7 7 9 3 2 1 3 11 4
+2
\ No newline at end of file
diff --git a/src/od/2024e200/project-scheduling/assets/output1.txt b/src/od/2024e200/project-scheduling/assets/output1.txt
new file mode 100644
index 000000000..368f89cee
--- /dev/null
+++ b/src/od/2024e200/project-scheduling/assets/output1.txt
@@ -0,0 +1 @@
+28
\ No newline at end of file
diff --git a/src/od/2024e200/project-scheduling/index.md b/src/od/2024e200/project-scheduling/index.md
new file mode 100644
index 000000000..df5582a4f
--- /dev/null
+++ b/src/od/2024e200/project-scheduling/index.md
@@ -0,0 +1,33 @@
+# 项目排期
+
+## 题目描述
+
+项目组共有N个开发人员, 项目经理接到了M个独立的需求, 每个需求的工作量不同, 且每个需求只能由一个开发人员独立完成, 不能多人合作.
+假定各个需求直接无任何先后依赖关系, 请设计算法帮助项目经理进行工作安排, 使整个项目能用最少的时间交付.
+
+### 输入描述
+
+- 第一行输入为M个需求的工作量, 单位为天, 用逗号隔开
+    - 例如 X1 X2 X3 … Xm, 表示共有M个需求, 每个需求的工作量分别为X1天, X2天…Xm天
+    - 其中 0<M<30, 0<Xm<200
+- 第二行输入为项目组人员数量N
+
+### 输出描述
+
+最快完成所有工作的天数.
+
+### 示例1
+
+输入:
+
+```text
+{{#include assets/input1.txt}}
+```
+
+输出:
+
+```text
+{{#include assets/output1.txt}}
+```
+
+## 题解
\ No newline at end of file
diff --git a/src/od/2024e200/project-scheduling/src/main.rs b/src/od/2024e200/project-scheduling/src/main.rs
new file mode 100644
index 000000000..e7a11a969
--- /dev/null
+++ b/src/od/2024e200/project-scheduling/src/main.rs
@@ -0,0 +1,3 @@
+fn main() {
+    println!("Hello, world!");
+}