Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/21769
Title: Resource optimal control in some single-machine scheduling problems
Authors: Cheng, TCE 
Janiak, A
Issue Date: 1994
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on automatic control, 1994, v. 39, no. 6, p. 1243-1246 How to cite?
Journal: IEEE transactions on automatic control 
Abstract: We consider a problem to schedule a set of jobs on a single machine under the constraint that the maximum job completion time does not exceed a given limit. Before a job is released for processing, it must undergo some preprocessing treatment which consumes resources. It is assumed that the release time of a job is a positive strictly decreasing continuous function of the amount of resources consumed. The objective is to minimize the totals resource consumption. We show that ordering jobs in nonincreasing processing times yields an optimal solution. We then consider a bicriterion approach to the problem in which the maximum job completion time and the resource consumption are simultaneously minimized and present a polynomial time solution algorithm. Finally, we consider a related problem in which the job release times are given but the processing times are functions of the amount of resource consumed. We show that ordering jobs in nondecreasing release times gives an optimal solution and that the problem to minimize both the maximum completion time and resource consumption is polynomially solvable.
URI: http://hdl.handle.net/10397/21769
ISSN: 0018-9286
EISSN: 1558-2523
DOI: 10.1109/9.293187
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

60
Last Week
0
Last month
0
Citations as of Jul 21, 2017

WEB OF SCIENCETM
Citations

51
Last Week
0
Last month
0
Citations as of Jul 15, 2017

Page view(s)

37
Last Week
1
Last month
Checked on Jul 9, 2017

Google ScholarTM

Check

Altmetric



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