![](/images/graphics-bg.png)
Single-Machine Group Scheduling Problems with Variable Job Processing Times
Joint Authors
Source
Mathematical Problems in Engineering
Issue
Vol. 2015, Issue 2015 (31 Dec. 2015), pp.1-9, 9 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2015-07-27
Country of Publication
Egypt
No. of Pages
9
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Ji, Ping& Li, Lin. 2015. Single-Machine Group Scheduling Problems with Variable Job Processing Times. Mathematical Problems in Engineering،Vol. 2015, no. 2015, pp.1-9.
https://search.emarefa.net/detail/BIM-1074655
Modern Language Association (MLA)
Ji, Ping& Li, Lin. Single-Machine Group Scheduling Problems with Variable Job Processing Times. Mathematical Problems in Engineering No. 2015 (2015), pp.1-9.
https://search.emarefa.net/detail/BIM-1074655
American Medical Association (AMA)
Ji, Ping& Li, Lin. Single-Machine Group Scheduling Problems with Variable Job Processing Times. Mathematical Problems in Engineering. 2015. Vol. 2015, no. 2015, pp.1-9.
https://search.emarefa.net/detail/BIM-1074655
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1074655