As an NP-hard problem, production scheduling requires considerable time to obtain even an approximate solution. This article investigates the feasibility of using a deep learning model to solve typical single-machine scheduling problems. In experiments, the proposed model demonstrated high learning efficiency and prediction accuracy in addressing these problems.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Using Deep Learning Models to Solve Single Machine Scheduling Questions

  • Jian-Feng Chen,
  • Yi-Chung Chen

摘要

As an NP-hard problem, production scheduling requires considerable time to obtain even an approximate solution. This article investigates the feasibility of using a deep learning model to solve typical single-machine scheduling problems. In experiments, the proposed model demonstrated high learning efficiency and prediction accuracy in addressing these problems.