文摘
Single machine scheduling problems under position dependent fuzzy learning effect with fuzzy processing times. Three objectives are to minimize makespan, total completion time and total weighted completion time, respectively. Furthermore, we show that these three problems are polynomially solvable under position-dependent fuzzy learning effect with fuzzy processing times. Present polynomially solvable algorithms for different confidence levels for these problems.