Single Machine Scheduling With Multiple Common Due-window Assignment

Scheduling is an emerging branch of operations research,which has been widely used in factory production,business management,computer science and technology and many other aspects.It is optimal to complete a batch of tasks or assignments with a number of processors,machines or resources.This paper mainly discusses single machine scheduling problem with multiple common due-window assignment.The main contents are as follows.In chapter 1,it introduces the research background,the development situation and the information collected in this paper.In chapter 2,it considers single machine scheduling with multiple common due-window assignment and a maintenance activity.Now more and more researchers study scheduling problem with a delivery time window.Based on the study of the single machine scheduling problem with multiple common due-window assignment,this chapter puts forward the consideration of the maintenance activity and the aging effect of assignments.The processing time of assignments is a function about its position and its aging factor in a sequence.Any two windows can not overlap.Once the maintenance activity has been completed,the machine will revert to its initial condition and the aging effect will start anew,the maintenance duration depends on its starting time.It divides all jobs into some groups.Every group has a common due-window.The objective is to find the due-window position and size,the maintenance activity position and the job sequence to minimize the total of earliness penalty,tardiness penalty,the starting time of due-window and the size of due-window.It introduces an algorithm to solve the problem.In chapter 3,it considers a single-machine scheduling problem based on multiple common slack due-window,a common flow allowance,maintenance,and resource allocation and focuses on how to find the optimal solution under certain resource constraints.This chapter assumes that all tasks have a slack window whose length varies with the task.In order to improve production efficiency,it is given a budget of resource that does not exceed U.Once the maintenance activity has been completed,the machine will revert to its initial condition and the aging effect will start anew,the maintenanceduration depends on its starting time.it assumes the actual processing time of a job is a convex function of its position and resource allocation.The objective is to find the common flow allowance,the due-window size,the resource allocation and the job sequence which minimizes the total cost of earliness penalty,tardiness penalty,the starting time of due-window,the size of due-window,makespan,the total of completion time of all jobs and resource allocation.We introduce an efficient algorithm to solve the problem.Finally,it summarizes the contents of this paper.