Back to results list
Please use this identifier to cite or link to this item:
|Title:||Single-machine group scheduling problems with variable job processing times||Authors:||Ji, P
|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||Rights:||Copyright © 2015 Ping Ji and Lin Li. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
The following article: Ji, P., & Li, L. (2015). Single-machine group scheduling problems with variable job processing times. Mathematical Problems in Engineering, 2015, is available at https//doi.org/10.1155/2015/758919
|Appears in Collections:||Journal/Magazine Article|
Show full item record
Files in This Item:
|Ji_Single-Machine_Group_Scheduling.pdf||1.96 MB||Adobe PDF||View/Open|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.