排程
排班首要面對的就是效率問題。以數學而言,排班問題通常就是最佳化問題。以航空公司為例,使用機場每個登機口皆需計時付費,「分配登機口」就是一項任務,而「登機口」就是可供利用的資源,若將登機口使用數量及時間壓到最低,亦即能節省最多的成本。
「」的各地常用別名 | |
---|---|
中国大陸 | |
港臺 |
排程或譯排班,是將任務分配至資源的過程,在計算機或生產處理中尤為重要。
常見排程
- 依序循環排程(RR,Round-robin scheduling)
- 最短先做排班(SJN,Shortest job next)
- Shortest remaining time
- Weighted round-robin scheduling
- 速率单调 (RMS)
- Deadline-monotonic scheduling (DMS)
- Earliest deadline first scheduling (EDF)
- Two-level scheduling
- 先進先出
- LIFO
- Fair-share scheduling
- 完全公平排程 (CFS)
- Least slack time scheduling (LST)
- Multilevel Feedback Queue
- Take scheduling
- Gang scheduling
- Least-connection scheduling
- Weighted least-connection scheduling
- Shortest expected delay scheduling
- Never queue scheduling
- List scheduling
- Genetic Anticipatory
- Lottery Scheduling
- 关键路径
磁碟臂排程
- 最短寻道优先
- 电梯算法
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.