Multitasking scheduling problems with a common due-window

We study multitasking scheduling and due-window assignment problems in a single machine, which can be found in various application domains. In multitasking environment, unfinished job always interrupts in-processing job. In common due window assignment, the aim is to find optimal due window to minimise the value of the earliness and tardiness penalty. In this paper, we study two problems, where the objective of the first problem is minimise the earliness, tardiness, due-window starting time, and due-window size costs, the objective of the second problem is minmax common due-date with completion time penalty, then we obtain some analytical properties and provide polynomial time solutions. Finally, the experimental results show that the proposed methods are effective.

Automated summary

The study focuses on multitasking scheduling and due-window assignment problems in a single machine. Two objectives are studied in the paper, with analytical properties and polynomial time solutions provided for optimal results. Experimental results demonstrate the effectiveness of the proposed methods.