Several Kinds Of Single Machine Scheduling Problems With Learning Effects And Deteriorating Jobs

In the classical scheduling theory,the actual processing time of the job is usually not considered with the processed job's position in the machine.However,in practice,job's processing time can be affected by many factors,such as learning effects and deteriorating jobs.And to study the processing of the job with setup time,delivery time,due-window assignment is also significant issue.This paper discusses two types of single machine scheduling problems with learning effects and deteriorating jobs.The details are summarized as below:The first chapter simply introduces the research status about the problem with learning effect and deteriorating jobs.The second chapter discusses the problem of single machine scheduling with non-linear setups time and delivery times,in which the actual processing time of a job is given as a function of its starting times and position in a sequence.The setup time and delivery time of a job is assumed to be p-s-d form(past-sequence-dependent),that means they are correlative with the actual processing time of processed jobs,and its scheduled position.Here,the objective functions about the makespan,the total completion times,the total weighted completion times,the sum the ? th power of job completion times and the maximum tardiness were discussed.As a result,the optimal schedule for these single-machine problems was described and it's also proved they are solvable in polynomial time respectively.The third chapter discusses the single machine scheduling problems with rejection and due-window assignment.The processing times of jobs are defined as functions of their start times and position in a sequence.A job will be rejected,or be accepted.The rejected job must pay the rejection spending and every accepted job was assumed to have same due-window size.If a job is completed within the window it incurs no penalty,otherwise,it incurs either earliness or tardiness penalties.Two problems were discussed here.The total costs objective function of first problem is associated with the window beginning time,window size,earliness time,tardiness time,the makespan and rejection cost.And the total costs objective function of secondproblem is associate with the window beginning time,window size,the number of earliness and tardiness jobs,makespan and rejection cost.The polynomial time algorithms for the problems were deduced respectively.