Slack Due-Window Assignment Scheduling Problem with Deterioration Effects and a Deteriorating Maintenance Activity

This paper studies the slack due-window assignment scheduling problem with deterioration effects and a deterioration maintenance activity on a single-machine. The machine deteriorates during the machining process, and at a certain moment performs a deterioration maintenance activity, that is, the duration time of the maintenance activity is a linear function of the maintenance starting time. It is needed to make a decision on when to schedule the deteriorating maintenance activity, the optimal common flow allowances and the sequence of jobs to minimize the weighted penalties for the sum of earliness and tardiness, weighted number of early and delayed, and weighted due-window starting time and size. This paper proposes a polynomial time algorithm to solve this problem.

Single-Machine Due-Window Assignment Scheduling with Resource Allocation and Generalized Earliness/Tardiness Penalties

In this study, the due-window assignment single-machine scheduling problem with resource allocation is considered, where the processing time of a job is controllable as a linear or convex function of amount of resource allocated to the job. Under common due-window and slack due-window assignments, our goal is to determine the optimal sequence of all jobs, the due-window start time, due-window size, and optimal resource allocation such that a sum of the scheduling cost (including weighted earliness/tardiness penalty, weighted number of early and tardy job, weighted due-window start time, and due-window size) and resource consumption cost is minimized. We analyze the optimality properties, and provide polynomial time solutions to solve the problem under four versions of due-window assignment and resource allocation function.

Study on Single-Machine Group Scheduling with Due-Window Assignment and Position-Dependent Weights

This article considers a single-machine group scheduling problem with due-window assignment, where the jobs are classified into groups and the jobs in the same group must be processed in succession. The goal is to minimize the weighted sum of lateness and due-window assignment cost, where the weights depend on the position in which a job is scheduled (i.e., position-dependent weights). For the common, slack, and different due-window assignment methods, we prove that the problem can be solved polynomially, i.e., in O N log N time, where N is the number of jobs.

Multitasking scheduling problem 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 this paper, we study two problems, the rst objective is minimise the earliness, tardiness, due-window starting time, and due-window size costs, the second objective is minmax common due-date with completion time penalty, then we provide polynomial time solutions. Finally, the experimental results show that the proposed methods are e ective.