机电工程技术2025，Vol.54Issue(10)：40-46,7.DOI:10.3969/j.issn.1009-9492.2025.10.009
制造期最小化零等待排序流水车间调度问题综述
A Review of the Research on the NWPFSP Problem in Minimizing Make-span
曾洁莹 1王凡2
作者信息
- 1. 国义招标股份有限公司,广州 510080
- 2. 深圳尚科宁家科技有限公司,广东 深圳 518000
- 折叠
摘要
Abstract
The no-wait permutation flow-shop scheduling problem(NWPFSP)is a permutation flow-shop scheduling problem(PFSP)class with no-wait constraints.Although the problem is a typical NP-hard problem and widely exists in real industrial production environments,there are relatively few extensive and in-depth review papers on the current state of the art of research for solving this type of scheduling problem;and,considering the make-span minimization is the main optimization objective of this type of scheduling problem.Therefore,a review of the current state of the art of NWPFSP research on make-span minimization is focused on,which covers in problem definition and the recent advances in main solution methods or algorithmic techniques.Finally,by combing the related literature and research results,the development trend and future research directions in this field are analyzed and prospected.关键词
制造期/零等待/排序流水车间/调度Key words
make-span/no-wait/permutation flow-shop/scheduling分类
机械工程引用本文复制引用
曾洁莹,王凡..制造期最小化零等待排序流水车间调度问题综述[J].机电工程技术,2025,54(10):40-46,7.
