Note on a unified approach to the single-machine scheduling problem with a deterioration effect and convex resource allocation

2016 ◽  
Vol 38 ◽  
pp. 134-140 ◽  
Author(s):  
Chuanli Zhao ◽  
Chou-Jung Hsu ◽  
Wen-Hsiang Wu ◽  
Shuenn-Ren Cheng ◽  
Chin-Chia Wu
Keyword(s):  
Resource Allocation ◽  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Unified Approach ◽  
Deterioration Effect ◽  
Convex Resource Allocation

Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times

2015 ◽  
Vol 32 (05) ◽  
pp. 1550033 ◽  
Author(s):  
Xin-Jun Li ◽  
Jian-Jun Wang ◽  
Xue-Ru Wang
Keyword(s):  
Resource Allocation ◽  
Single Machine ◽  
Learning Effect ◽  
Waiting Times ◽  
Deteriorating Jobs ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Optimal Sequence ◽  
Processing Times ◽  
Convex Resource Allocation

This paper considers single-machine scheduling with learning effect, deteriorating jobs and convex resource dependent processing times, i.e., the processing time of a job is a function of its starting time, its position in a sequence and its convex resource allocation. The objective is to find the optimal sequence of jobs and the optimal convex resource allocation separately to minimize a cost function containing makespan, total completion (waiting) time, total absolute differences in completion (waiting) times and total resource cost. It is proved that the problem can be solved in polynomial time.

Sign in / Sign up

Export Citation Format

Share Document