![](/images/graphics-bg.png)
Single-Machine Scheduling Problems with a Sum-of-Processing-Time-Based Learning Function
Joint Authors
Source
International Journal of Combinatorics
Issue
Vol. 2009, Issue 2009 (31 Dec. 2009), pp.1-8, 8 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2010-01-31
Country of Publication
Egypt
No. of Pages
8
Main Subjects
Abstract EN
Recently, learning scheduling problems have received increasing attention.
However, the majority of the research assume that the actual job processing time is a function of its position.
This paper deals with the single-machine scheduling problem with a sum-of-processing-time-based learning effect.
By the effect of sum-of-processing-time-based learning, we mean that the processing time of a job is defined by total normal processing time of jobs in front of it in the sequence.
We show that the single-machine makespan problem remains polynomially solvable under the proposed model.
We show that the total completion time minimization problem for a≥1 remains polynomially solvable under the proposed model.
American Psychological Association (APA)
Zhang, Xingong& Yan, Guangle. 2010. Single-Machine Scheduling Problems with a Sum-of-Processing-Time-Based Learning Function. International Journal of Combinatorics،Vol. 2009, no. 2009, pp.1-8.
https://search.emarefa.net/detail/BIM-486011
Modern Language Association (MLA)
Zhang, Xingong& Yan, Guangle. Single-Machine Scheduling Problems with a Sum-of-Processing-Time-Based Learning Function. International Journal of Combinatorics No. 2009 (2009), pp.1-8.
https://search.emarefa.net/detail/BIM-486011
American Medical Association (AMA)
Zhang, Xingong& Yan, Guangle. Single-Machine Scheduling Problems with a Sum-of-Processing-Time-Based Learning Function. International Journal of Combinatorics. 2010. Vol. 2009, no. 2009, pp.1-8.
https://search.emarefa.net/detail/BIM-486011
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-486011