Two Types Processing Time For Single Machine Scheduling Problem With Controllable Variables

The actual processing time of a job in the classical scheduling, is regarded as a fixed constant. However, In the actual production, the actual processing time of the job often may be related to its starting time,its position in a schedule, or its resource allocation.This thesis consists of four parts. Chapter one tells some background knowledge of scheduling problems and controllable scheduling problems. Chapter two we consider due date assignment and single-machine scheduling problems with learning effect and controllable processing times.The actual processing time of a job depends on its position in a sequence and related resource consumption which contains linear resource consumption or convex resource consumption.The due date assignment methods studied include the common due date and the slack due date. For each combination of the resource consumption function and due date assignment methods, a polynomial-time algorithm is given to minimize an integrated objective function, which includes the weighted number of tardy jobs, due date assignment, makespan and total resource consumption costs. Chapter three considers controllable scheduling problem on a single machine with effect of learning and deterioration. In this model, the actual processing time of a job depends on its starting time, its position in a sequence and its related resource allocation. The due date assignment methods studied include the common due date, the slack due date, the most general method of unrestricted due dates and the common due window, where each job may be assigned a different due date. To find the optimal job sequence, due date values, and resource allocations that minimize an integrated objective function, which includes earliness, tardiness, due date assignment, total completion time and total resource consumption costs. For each combination of the due date assignment methods and processing-time function, we provide a polynomial-time algorithm. In particular, when the processing time for a convex resource consumption function, this chapter discusses the machine have no deterioration effects of special circumstances. Chapter four summarize the results of the thesis and put forward some prospect.