Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/25185
Title: Single-Machine Group Scheduling Problems with Variable Job Processing Times
Authors: Ji, P 
Li, L
Issue Date: 2015
Publisher: Hindawi Publishing Corporation
Source: Mathematical problems in engineering, 2015, v. 2015, 758919 How to cite?
Journal: Mathematical problems in engineering 
Abstract: This paper considers two resource constrained single-machine group scheduling problems. These problems involve variable job processing times (general position-dependent learning effects and deteriorating jobs); that is, the processing time of a job is defined by the function that involves its starting time and position in the group, and groups' setup time is a positive strictly decreasing continuous function of the amount of consumed resource. Polynomial time algorithms are proposed to optimally solve the makespan minimization problem under the constraint that the total resource consumption does not exceed a given limit and the total resource consumption minimization problem under the constraint that the makespan does not exceed a given limit, respectively.
URI: http://hdl.handle.net/10397/25185
ISSN: 1024-123X
EISSN: 1563-5147
DOI: 10.1155/2015/758919
Appears in Collections:Journal/Magazine Article

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

WEB OF SCIENCETM
Citations

1
Last Week
0
Last month
0
Citations as of Aug 22, 2017

Page view(s)

23
Last Week
0
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



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