期刊
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
卷 53, 期 4, 页码 1228-1241出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207543.2014.954057
关键词
scheduling; learning effect; common flow allowance; due-window; resource allocation
资金
- National Natural Science Foundation of China [61174171, 71471120]
This article considers a single-machine due-window assignment scheduling problem based on a common flow allowance (i.e. all jobs have slack due window (SLKW)). We assume that the actual processing time of a job is a function of its position in a sequence (learning effect) and its continuously divisible and non-renewable resource allocation. The problem is to determine the optimal due windows, the optimal resource allocation and the processing sequence simultaneously to minimise costs for earliness, tardiness, the window location, window size, makespan and resource consumption. For a linear or a convex function of the amount of a resource allocated to the job, we provide a polynomial time algorithm, respectively. Some extensions of the problem are also shown.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据