期刊
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION
卷 18, 期 4, 页码 2567-2578出版社
AMER INST MATHEMATICAL SCIENCES-AIMS
DOI: 10.3934/jimo.2021081
关键词
Due-window assignment; scheduling; single machine; learning and deterioration effects
This paper discusses single machine scheduling problems with position-dependent weights and the learning and deterioration effects of jobs processing times, aiming to minimize the weighted sum of earliness-tardiness under different due-window assignments. It shows that these problems can be solved in polynomial time.
This paper considers single machine due-window assignment sched-uling problems with position-dependent weights. Under the learning and dete-rioration effects of jobs processing times, our goal is to minimize the weighted sum of earliness-tardiness, starting time of due-window, and due-window size, where the weights only depends on their position in a sequence (i.e., position-dependent weights). Under common due-window (CONW), slack due-window (SLKW) and different due-window (DIFW) assignments, we show that these problems remain polynomial-time solvable.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据