期刊
ENGINEERING OPTIMIZATION
卷 52, 期 2, 页码 185-193出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/0305215X.2019.1577411
关键词
Due-window assignment; scheduling; production planning; sequencing
资金
- National Natural Science Foundation of China [71471120]
- Support Program for Innovative Talents in Liaoning University of China [LR2016017]
- Liaoning Bai Qian Wan Talents Program of China
- Foundation of the Education Department of Liaoning (China) [L201753]
- Program for Liaoning Natural Science Foundation Research (China) [201601177]
This article deals with an integrated optimization problem of production scheduling and common due-window assignment on a single machine. The objective is to minimize the total cost, which is a weighted sum function of earliness and tardiness, due-window starting time, and due-window size, where the weights only depend on their position in a sequence (i.e. position-dependent weights). A polynomial time solution algorithm is provided for the corresponding problem. The problem can also be extended to slack due-windows assignment and general position-dependent processing times. It is proved that both these extensions remain polynomially solvable.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据