Scheduling Problems With Different Controllable Parameters

This thesis consists of four parts. Chapter one introduces some background information of scheduling problems and controllable prameter problems. Chapter two investigates single machine scheduling problems with controllable due dates. Optimal solutions of problems 1｜d_j(Δ) = d_j +β_jΔ｜L_max + eΔand 1｜d_j(Δ) = d_j +β_jΔ｜∑U_j + eΔare given. Chapter three discusses two single machine scheduling problems with controllable processing times and leaning effect. The ob_jective functions are makespan and total completion time respectively: 1｜p_jr = (p_j + a_j u_j )r^α,∑u_j≤Q｜C_max and 1｜p_jr = (p_j + a_j u_j )r^α,∑u_j≤Q｜∑C_j. Under a given _job sequence, properties on optimal resource allocation are discussed. With these properties optimal algorthms are given respectively for p_j = p, a_j = a; p_j = p, u_j= u ; and a_j = a, u_j=u. In chapter four, we summarize the thesis and propose some new problems.