Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/17175
Title: Scheduling jobs with processing times dependent on position, starting time, and allotted resource
Authors: Wang, JB
Wang, MZ
Ji, P 
Keywords: deteriorating jobs
learning effect
resource allocation
Scheduling
single-machine
Issue Date: 2012
Publisher: World Scientific
Source: Asia-pacific journal of operational research, 2012, v. 29, no. 5, 1250030 How to cite?
Journal: Asia-Pacific journal of operational research 
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.
URI: http://hdl.handle.net/10397/17175
ISSN: 0217-5959
EISSN: 1793-7019
DOI: 10.1142/S0217595912500303
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

19
Last Week
1
Last month
2
Citations as of Oct 9, 2018

WEB OF SCIENCETM
Citations

15
Last Week
0
Last month
1
Citations as of Oct 6, 2018

Page view(s)

64
Last Week
2
Last month
Citations as of Oct 15, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.