![](/images/graphics-bg.png)
Single-Machine Group Scheduling Problems with Deterioration to Minimize the Sum of Completion Times
Joint Authors
Source
Mathematical Problems in Engineering
Issue
Vol. 2012, Issue 2012 (31 Dec. 2012), pp.1-9, 9 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2012-12-04
Country of Publication
Egypt
No. of Pages
9
Main Subjects
Abstract EN
We consider two single-machine group scheduling problems with deteriorating group setup and job processing times.
That is, the job processing times and group setup times are linearly increasing (or decreasing) functions of their starting times.
Jobs in each group have the same deteriorating rate.
The objective of scheduling problems is to minimize the sum of completion times.
We show that the sum of completion times minimization problems remains polynomially solvable under the agreeable conditions.
American Psychological Association (APA)
He, Yong& Sun, Li. 2012. Single-Machine Group Scheduling Problems with Deterioration to Minimize the Sum of Completion Times. Mathematical Problems in Engineering،Vol. 2012, no. 2012, pp.1-9.
https://search.emarefa.net/detail/BIM-1029521
Modern Language Association (MLA)
He, Yong& Sun, Li. Single-Machine Group Scheduling Problems with Deterioration to Minimize the Sum of Completion Times. Mathematical Problems in Engineering No. 2012 (2012), pp.1-9.
https://search.emarefa.net/detail/BIM-1029521
American Medical Association (AMA)
He, Yong& Sun, Li. Single-Machine Group Scheduling Problems with Deterioration to Minimize the Sum of Completion Times. Mathematical Problems in Engineering. 2012. Vol. 2012, no. 2012, pp.1-9.
https://search.emarefa.net/detail/BIM-1029521
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1029521