Optimal due-date assignment problem with learning effect and resource-dependent processing times |
| |
Authors: | Yuan-Yuan Lu Gang Li Yu-Bin Wu Ping Ji |
| |
Affiliation: | 1. College of Mathematics, Jilin Normal University, Siping, Jilin, 136000, China 2. School of Management, Xi’an Jiaotong University, Xi’an, 710049, China 3. School of Science, Shenyang Aerospace University, Shenyang, Liaoning, 110136, China 4. Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
|
| |
Abstract: | In this paper, we consider a single-machine earliness-tardiness scheduling problem with due-date assignment, in which the processing time of a job is a function of its position in a sequence and its resource allocation. The due date assignment methods studied include the common due date, and the slack due date, which reflects equal waiting time allowance for the jobs. For each combination of due date assignment method and processing time function, we provide a polynomial-time algorithm to find the optimal job sequence, due date values, and resource allocations that minimize an integrated objective function, which includes earliness, tardiness, due date assignment, and total resource consumption costs. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|