点击次数：
论文类型：期刊论文
发表时间：2016-02-16
发表刊物：INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
收录刊物：EI、SCIE、Scopus
卷号：54
期号：4
页面范围：1186-1195
ISSN号：0020-7543
关键字：scheduling; resource allocation; due window assignment
摘要：This paper considers a single-machine scheduling problem involving convex resource-dependent processing times and due-window assignment simultaneously. The goal is to minimise the total resource consumption cost under the constraint that the schedule cost involving earliness, tardiness, window location, window size and makespan does not exceed a given limit for two popular due window assignment methods: the common flow allowance (slack) due window assignment method (referred to SLKW) and the common due window assignment method (referred to CONW). We show that the problem can be solved in polynomial time. Some extensions of the problem are also given.