Due-window assignment problems with unit-time jobs

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.

Download Full-text

Single-machine scheduling CON/SLK due window assignment problems with sum-of-processed times based learning effect

Applied Mathematics and Computation ◽

10.1016/j.amc.2014.11.011 ◽

2015 ◽

Vol 250 ◽

pp. 628-635 ◽

Cited By ~ 6

Author(s):

Zhang Xingong ◽

Wang Yong

Keyword(s):

Single Machine ◽

Learning Effect ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Assignment Problems ◽

Due Window ◽

Due Window Assignment

Download Full-text

Multiple Common Due-Window Assignment Based on Common Flow Allowance and Resource-Dependent Processing Times

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.644-650.2026 ◽

2014 ◽

Vol 644-650 ◽

pp. 2026-2029

Author(s):

Cheng Xin Luo ◽

En Min Feng

Keyword(s):

Optimal Algorithm ◽

Window Size ◽

Optimal Size ◽

Processing Times ◽

Due Windows ◽

Resource Cost ◽

Due Window ◽

Resource Allocation Scheme ◽

Due Window Assignment ◽

Flow Allowance

This paper studies a multiple common due-window assignment problem on a single machine. The job-dependent due-windows are obtained based on common flow allowance criteria. We assume that the processing time of a job is controllable by the resource amount assigned to it. The objective is to find the optimal size and location of the multiple common due-windows, the set of jobs assigned to each due window, the sequence of jobs and resource allocation scheme to minimize a cost function based on the window size and location, earliness and tardiness of jobs and resource cost. We propose an optimal algorithm to solve the problem.

Download Full-text

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

Asia Pacific Journal of Operational Research ◽

10.1142/s0217595922500051 ◽

2022 ◽

Author(s):

Xue Jia ◽

Dan-Yang Lv ◽

Yang Hu ◽

Ji-Bo Wang ◽

Zhi Wang ◽

...

Keyword(s):

Polynomial Time Algorithm ◽

Time Algorithm ◽

Machining Process ◽

Scheduling Problem ◽

Maintenance Activity ◽

Starting Time ◽

Weighted Number ◽

Deteriorating Maintenance ◽

Due Window ◽

Due Window Assignment

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.

Download Full-text

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

Asia Pacific Journal of Operational Research ◽

10.1142/s021759592150041x ◽

2021 ◽

pp. 2150041

Author(s):

Yu Tian

Keyword(s):

Resource Allocation ◽

Single Machine ◽

Window Size ◽

Single Machine Scheduling ◽

Start Time ◽

Optimal Sequence ◽

Optimal Resource ◽

Due Window ◽

Weighted Earliness ◽

Due Window Assignment

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.

Download Full-text