Two-machine flow shop scheduling with a common due date to maximize total early work

Xin Chen,Qian Miao,Bertrand M.T. Lin,Malgorzata Sterna,Jacek Blazewicz

European Journal of Operational Research（2022）

引用 5|浏览8

暂无评分

摘要

•Two-machine ow shop scheduling to maximize total early work is considered.•A dynamic programming approach running in O(n2d2) time is proposed.•A fully polynomial time approximation scheme (FPTAS) is developed.•The approximation results work for the weighted model - if a specific constraint is satisfied.

查看译文

关键词

Combinatorial optimization,Flow shop scheduling,Early and late work,Dynamic programming,FPTAS

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要