scholarly journals Multitasking scheduling problem with a common due-window

2021 ◽  
Author(s):  
chen xu ◽  
Yinfeng Xu ◽  
Feifeng Zheng ◽  
Ming Liu
Keyword(s):  
Single Machine ◽  
Completion Time ◽  
Window Size ◽  
Scheduling Problem ◽  
Due Date ◽  
Assignment Problems ◽  
Common Due Date ◽  
Starting Time ◽  
Due Window ◽  
Due Window Assignment

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.

scholarly journals Optimization for Due-Window Assignment Scheduling with Position-Dependent Weights

2020 ◽  
Vol 2020 ◽  
pp. 1-7 ◽  
Author(s):  
Li-Yan Wang ◽  
Dan-Yang Lv ◽  
Bo Zhang ◽  
Wei-Wei Liu ◽  
Ji-Bo Wang
Keyword(s):  
Single Machine ◽  
General Position ◽  
Processing Time ◽  
Window Size ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Scheduling Problem ◽  
Starting Time ◽  
Due Window ◽  
Due Window Assignment

This paper considers a single-machine due-window assignment scheduling problem with position-dependent weights, where the weights only depend on their position in a sequence. The objective is to minimise the total weighted penalty of earliness, tardiness, due-window starting time, and due-window size of all jobs. Optimal properties of the problem are given, and then, a polynomial-time algorithm is provided to solve the problem. An extension to the problem is offered by assuming general position-dependent processing time.

Single Machine Due Window Assignment and Scheduling with an Optional Maintenance Activity

2014 ◽  
Vol 1006-1007 ◽  
pp. 437-440
Author(s):  
Wei Xuan Li ◽  
Chuan Li Zhao
Keyword(s):  
Single Machine ◽  
Window Size ◽  
Aging Effect ◽  
Single Machine Scheduling ◽  
Maintenance Activity ◽  
Starting Time ◽  
Actual Duration ◽  
Window Position ◽  
Due Window ◽  
Due Window Assignment

This paper considers single machine scheduling with general position-dependent and job-dependent aging effect. All jobs share a common due window, and an optional maintenance activity (OMA) is taken into consideration. The processing time of a job is a non-decreasing function in its position. Such category of maintenance activity is called the OMA since one can determine the position and the actual duration of it. The objective is to determine the optimal due window position, the optimal location and duration of the OMA, and the optimal job sequence so as to minimize the total of earliness, tardiness, due window starting time, due window size, and the OMA duration related costs. We show that the considered problem can be solved in polynomial time.

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

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.

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

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.

Due-Window Assignment for a Single Machine Scheduling with Both Deterioration and Positional Effects

2015 ◽  
Vol 32 (03) ◽  
pp. 1550014 ◽  
Author(s):  
Chuanli Zhao ◽  
Hengyong Tang
Keyword(s):  
Single Machine ◽  
Polynomial Solution ◽  
Window Size ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Due Windows ◽  
Due Window ◽  
Positional Effects ◽  
Due Window Assignment ◽  
Flow Allowance

This paper considers a single machine scheduling with both deterioration and positional effects and due-window assignment problem. The job-dependent due-windows are obtained by the common flow allowance criterion. The objective is to schedule the jobs, and the due-windows so as to minimize the sum of earliness, tardiness, and due-window starting time and due-window size costs. We introduce a polynomial solution for the problem. Furthermore, we show how the solutions can be extended to the setting with job rejection.

Sign in / Sign up

Export Citation Format

Share Document