Single-machine scheduling with learning effect and resource-dependent processing times |
| |
Authors: | Dan Wang Ming-Zheng Wang Ji-Bo Wang |
| |
Affiliation: | 1. Operations Research and Cybernetics Institute, School of Science, Shenyang Aerospace University, Shenyang 110136, China;2. School of Management, Dalian University of Technology, Dalian 116024, China;3. Knowledge Management and Innovation Research Centre, Xi’an Jiaotong University, Xi’an 710049, China |
| |
Abstract: | We consider resource allocation scheduling with learning effect in which the processing time of a job is a function of its position in a sequence and its resource allocation. The objective is to find the optimal sequence of jobs and the optimal resource allocation separately. We concentrate on two goals separately, namely, minimizing a cost function containing makespan, total completion time, total absolute differences in completion times and total resource cost; minimizing a cost function containing makespan, total waiting time, total absolute differences in waiting times and total resource cost. We analyse the problem with two different processing time functions. For each combination of these, we provide a polynomial time algorithm to find the optimal job sequence and resource allocation. |
| |
Keywords: | Scheduling Single-machine Learning effect Resource allocation |
本文献已被 ScienceDirect 等数据库收录! |
|