A three-agent scheduling problem for minimizing the makespan on a single machine

Computers & Industrial Engineering（2017）

引用 7|浏览13

暂无评分

摘要

•A three-agent scheduling problem regarding minimizing the makespan.•A branch-and-bound algorithm to search for the optimal solution.•An enhanced genetic algorithm with a dedicated local search.

查看译文

关键词

Job scheduling,Tardiness,Multi-agent,Makespan,Maintenance activity,Branch-and-bound algorithm

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要