Study on due-window assignment scheduling based on common flow allowance

2015 ◽  
Vol 165 ◽  
pp. 155-157 ◽  
Author(s):  
Yu-Bin Wu ◽  
Long Wan ◽  
Xiao-Yuan Wang
Keyword(s):  
Due Window ◽  
Due Window Assignment ◽  
Flow Allowance

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

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.

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.

Optimal Due-Window Assignment Based on Common Flow Allowance under Linear Deteriorating and Resource-Dependent Processing Times

2013 ◽  
Vol 344 ◽  
pp. 275-278
Author(s):  
Cheng Xin Luo
Keyword(s):  
Window Size ◽  
Optimal Size ◽  
Processing Times ◽  
Due Windows ◽  
Resource Cost ◽  
Due Window ◽  
The Common ◽  
Resource Allocation Scheme ◽  
Due Window Assignment ◽  
Flow Allowance

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

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.

Sign in / Sign up

Export Citation Format

Share Document