Some Scheduling Problems With Due-window Assignment And Controllable Processing Times

In some papers of scheduling problem it is assumed that the processing time is constant.However,there are many situations where the processing time may depend on its deteriorating effect,learning effect,the resource and the position in the sequence.Recently,more and more researchers have studied the problem which the processing time is controllable.In addition,in the problem with due-window assignment,if the job is completed outside the due-window,it would be penalized according to its earliness or tardiness value.We consider some scheduling problems with due-window assignment and controllable processing times in this paper.The details are as following:The first chapter introduces the background knowledge,the research status of scheduling problem as well as the main research content of this paper.The second chapter studies single-machine scheduling a deteriorating maintenance activity and due-window assignment.There are two models in this chapter.In the first model,the time of maintenance activity depends on its starting time and resource.In the second model,the time of maintenance activity depends on its position and resource.We consider three different positions of maintenance activity,and for each position we provide polynomial time algorithms.On the basis of previous chapter,we study discretely controllable processing times in the third chapter.It means that each job has multiple processing times to be selected and different processing times associated with different costs.Based on calculation and analysis,we found that the optimal job sequence exists in the three different positions of maintenance activity.We provide polynomial time algorithms for different situations.The forth chapter studies a kind of single-machine scheduling problem with due-window assignment.There are some resources for each job,the processing time of each job would be changed according to the resource.We consider two models.In have the common due-window.There are some constraints under objective function.Under the constraints,we provide polynomial-time algorithms which can be solved in()3O n.Finally,we summarize the main research content of this paper and put forward the future research direction.