点击次数：

论文类型： 期刊论文

发表时间： 2017-04-01

发表刊物： JOURNAL OF MANUFACTURING SYSTEMS

收录刊物： SCIE、EI、SSCI

卷号： 43

页面范围： 1-14

ISSN号： 0278-6125

关键字： Scheduling; Due window assignment; Resource allocation; Learning effects

摘要： This paper considers single machine scheduling problems which determine the optimal job schedule, due window location and resource allocation simultaneously. The optimized criteria consist of makespan, earliness, tardiness, due window starting time and size, and the allocated resource cost, to conform with just-in-time (JIT) manufacturing. The job's actual processing time is a general function of its position, starting time, and the resource quantity allocated for the job. Specifically, both the linear and convex resource consumption scenarios are considered. In the context of the linear and convex resource consumption, we present four research problems and prove that all of them are polynomially solvable under CON due window (all jobs share a common due window), SLK due window (each job is assigned an individual due window based on a common flow allowance) and DIF due window (each job has a different due window with no restrictions) assignment assumptions, respectively. (C) 2017 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All rights reserved.