Paper Info
Title
Scheduling Jobs with Processing times Dependent on Position, Starting Time, and Allotted Resource.
Abstract
We consider single-machine scheduling problem in which the processing time of a job is a function of its position in a sequence, its starting time, 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. The problem is modeled as an assignment problem, and thus can be solved in polynomial time. Some extensions of the problem are also shown.
Year
DOI
Venue
2012
10.1142/S0217595912500303
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH
Keywords
Field
DocType
Scheduling,single-machine,learning effect,deteriorating jobs,resource allocation
Learning effect,Mathematical optimization,Job shop scheduling,Scheduling (computing),Computer science,Real-time computing,Assignment problem,Resource allocation,Time complexity
Journal
Volume
Issue
ISSN
29
5
0217-5959
Citations 
PageRank 
References 
8
0.47
29
Authors
3
Name
Order
Citations
PageRank
Jibo Wang174541.50
Ming-Zheng Wang2534.52
P Ji318726.88