Yan, Yang; Wang, Dazhi; Wang, Dingwei; Ip, W. H.; Wang, Hongfeng Single machine group scheduling problems with the effects of deterioration and learning. (English) Zbl 1212.90166 Acta Autom. Sin. 35, No. 10, 1290-1295 (2009). Summary: This paper studies the single-machine scheduling problem with deterioration and learning under group consumption, where the processing time of a job is defined by a function of the starting time and position in the group. Based on the analysis of properties and polynomial algorithms, it can be shown that both the single-machine makespan minimization problem and the total resource minimization problem under group consumption are polynomially solvable, even though deterioration and learning effect on job processing time are introduced. Cited in 6 Documents MSC: 90B35 Deterministic scheduling theory in operations research 68T05 Learning and adaptive systems in artificial intelligence Keywords:single-machine scheduling; learning effect; makespan PDFBibTeX XMLCite \textit{Y. Yan} et al., Acta Autom. Sin. 35, No. 10, 1290--1295 (2009; Zbl 1212.90166) Full Text: DOI