×

Single machine group scheduling problems with the effects of deterioration and learning. (English) Zbl 1212.90166

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.

MSC:

90B35 Deterministic scheduling theory in operations research
68T05 Learning and adaptive systems in artificial intelligence
PDFBibTeX XMLCite
Full Text: DOI