A note on study on proportionate flowshop scheduling with due-date assignment and position-dependent weights

被引:0
作者
Jin Qian
Guisong Chang
机构
[1] Northeastern University,Department of Mathematics
来源
Optimization Letters | 2022年 / 16卷
关键词
Scheduling; Proportionate flowshop; Due date assignment; Position-dependent weights; Algorithm complexity;
D O I
暂无
中图分类号
学科分类号
摘要
In a recent paper (Lv and Wang, Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights. Optim. Lett., 2021. https://doi.org/10.1007/s11590-020-01670-4), Lv and Wang studied due date proportionate flowshop scheduling problems with position-dependent weights. For common due date and slack due date assignments, they proved that these two problems can be solved in O(nlogn)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(n\log n)$$\end{document} time respectively, where n is the number of jobs. For slack due date assignment, there is an error. We will show the error by a counter example and explain why it is incorrect.
引用
收藏
页码:2645 / 2648
页数:3
相关论文
共 4 条
[1]  
Lv DY(2021)Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights Optim. Lett. 62 595-603
[2]  
Wang JB(2015)On equivalence between the proportionate flow shop and single-machine scheduling problems Naval Res. Logist. undefined undefined-undefined
[3]  
Panwalkar SS(undefined)undefined undefined undefined undefined-undefined
[4]  
Koulamas C(undefined)undefined undefined undefined undefined-undefined