Due-Window Assignment Problems With Learning Effect And Deteriorating Jobs

The scheduling problem is an important combinatorial optimization problem, it has aprofound practical background and broad application prospects in manufacturing plantoptimized design, transport hub scheduling, control of the progress and etc.The target duration has become increasingly important in scheduling and supply chainmanagement. In many practical cases, the suppliers’ supply is based on the JIT principle.There are some different delivery situations and will produce earliness and tardiness costwhen the job is finished earlier or later than the due-date. So it is very important for thesuppliers to find out an appropriate duration. This paper discusses the case with a due-windowwhich a time interval needs to be determined such that jobs completed within this interval arenot penalized. Due-window reflects the real-life production, and the supplier is given someflexibility and is not restricted to a specific due-date.This paper analyzes the current research status and does the research based on thelearning and deteriorating effect model, giving three different kinds of specific due-windowperformances: the common due-window, the SLK due-window and the different due-window.At last we show that the problem remains polynomially solvable which the objectivefunction (the weighted sum of earliness, tardiness, beginning of the due-window and thedue-window) is minimum. We also give the numerical example to show how the algorithm isrealized.