Journal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Volume 53, Issue 4, Pages 1228-1241Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207543.2014.954057
Keywords
scheduling; learning effect; common flow allowance; due-window; resource allocation
Categories
Funding
- National Natural Science Foundation of China [61174171, 71471120]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available