TY - JOUR
A2 - Xu, Dehua
AU - Wu, Yu-Bin
AU - Ji, Ping
PY - 2015
DA - 2015/03/30
TI - Due-Window Assignment Scheduling with Variable Job Processing Times
SP - 740750
VL - 2015
AB - We consider a common due-window assignment scheduling problem jobs with variable job processing times on a single machine, where the processing time of a job is a function of its position in a sequence (i.e., learning effect) or its starting time (i.e., deteriorating effect). The problem is to determine the optimal due-windows, and the processing sequence simultaneously to minimize a cost function includes earliness, tardiness, the window location, window size, and weighted number of tardy jobs. We prove that the problem can be solved in polynomial time.
SN - 2356-6140
UR - https://doi.org/10.1155/2015/740750
DO - 10.1155/2015/740750
JF - The Scientific World Journal
PB - Hindawi Publishing Corporation
KW -
ER -