Journal
COMPUTER JOURNAL
Volume 61, Issue 9, Pages 1329-1337Publisher
OXFORD UNIV PRESS
DOI: 10.1093/comjnl/bxx121
Keywords
scheduling; learning effects; resource allocation; due date assignment
Categories
Funding
- National Natural Science Foundation of China [71471120, 71501082, 71672019, 71271039]
Ask authors/readers for more resources
This paper addresses resource allocation scheduling problems with CON/SLK due date assignment and job-dependent learning effects on a single machine. Two different resource consumption functions under common (denoted by CON) and slack (denoted by SLK) due date assignment are considered. The objective is to determine the optimal due dates of jobs, a sequence for jobs and resource allocation of jobs to minimize a total cost function. The optimality properties for all problems and polynomial time algorithms are proposed to solve these problems.
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