Optimal Common Due-Window Assignment with Linear Deteriorating and Resource-Dependent Processing Times under a Deteriorating Maintenance Activitiy

2013 ◽  
Vol 344 ◽  
pp. 290-293
Author(s):  
Cheng Xin Luo
Keyword(s):  
Window Size ◽  
Single Machine Scheduling ◽  
Scheduling Problems ◽  
Maintenance Activity ◽  
Machine Maintenance ◽  
Processing Times ◽  
Deteriorating Maintenance ◽  
Due Window ◽  
Resource Allocation Scheme ◽  
Due Window Assignment

This paper studies single-machine scheduling problems with a due-window assignment under a deteriorating maintenance and time-and-resource-dependent processing times. Jobs completed within the due-window incur no penalties, other jobs incur either earliness or tardiness penalties. The maintenance activity can be scheduled immediately after any of the completed jobs. We assume that once the maintenance activity has been completed, the machine efficiency will be improved and the machine maintenance duration depends on its starting time. The objective is to find the maintenance position, the size and location of the due-window, and the sequence of jobs and resource allocation scheme to minimize a cost function based on the window size and location and the earliness and tardiness of jobs and resource. We propose an algorithm to solve the problem.

Single-Machine Scheduling with Due-Window Assignment and Rate-Modifying-Activities under a Deteriorating Maintenance

2013 ◽  
Vol 278-280 ◽  
pp. 2248-2251
Author(s):  
Cheng Xin Luo
Keyword(s):  
Single Machine ◽  
Window Size ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Optimal Size ◽  
Scheduling Problems ◽  
Maintenance Activity ◽  
Deteriorating Maintenance ◽  
Due Window ◽  
Due Window Assignment

This paper studies single-machine scheduling problems with a due-window assignment and a rate-modifying activity under a deteriorating maintenance consideration simultaneously. Jobs completed within the due-window incur no penalties, other jobs incur either earliness or tardiness penalties. The maintenance activity can be scheduled immediately after any one of the completed jobs. We assume that once the maintenance activity has been completed, the machine efficiency will be improved and the machine maintenance duration depends on its starting time. The objective is to find the optimal maintenance position as well as the optimal size and location of the due-window, and the sequence of jobs to minimize a cost function based on the window size and window location and the earliness and tardiness of the jobs. We propose a polynomial time algorithm to solve the problem optimally.

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.

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.

COMMON DUE-WINDOW ASSIGNMENT AND SCHEDULING OF JOB-DEPENDENT DETERIORATING JOBS AND MULTIPLE DETERIORATING MAINTENANCE ACTIVITIES

2014 ◽  
Vol 31 (01) ◽  
pp. 1450004 ◽  
Author(s):  
XINGONG ZHANG
Keyword(s):  
Operations Management ◽  
Production Scheduling ◽  
Window Size ◽  
Deteriorating Jobs ◽  
Planning Horizon ◽  
Scheduling Problems ◽  
Deteriorating Maintenance ◽  
Due Window ◽  
Maintenance Activities ◽  
Due Window Assignment

Due-window assignment and production scheduling problems are important issues in operations management. In this paper, the problems of common due-window assignment and scheduling of job-dependent deteriorating jobs and multiple deteriorating maintenance activities simultaneously on a single-machine are investigated. We assume that the machine may be subjected to several maintenance activities during the planning horizon. However, due to the restriction of budget of maintenance, the upper bound of the maintenance frequency on the machine is assumed to be known in advance. Moreover, we assume that the duration of each maintenance activity depends on the running time of the machine. Polynomial time algorithms for the all the studied problems are provided, where the objective is to simultaneously minimize the earliness, tardiness, due-window starting time, and due-window size costs.

Common Due-Window Assignment and Group Scheduling with Position-Dependent Processing Times

2015 ◽  
Vol 32 (06) ◽  
pp. 1550045 ◽  
Author(s):  
Shang-Chia Liu
Keyword(s):  
Single Machine ◽  
Group Technology ◽  
Window Size ◽  
Setup Time ◽  
Single Machine Scheduling ◽  
Processing Times ◽  
Weighted Number ◽  
Due Window ◽  
Tardy Jobs ◽  
Due Window Assignment

This paper investigates a single-machine scheduling problem involving both the due-window assignment and position-dependent processing times under a group technology environment. By position-dependent processing times, we mean that the processing time of a job is dependent of its processing position in the job sequence within the group it belongs to. A setup time is incurred whenever the single machine transfers job processing from a group to another group. Each group is assigned an assignable common due-window. A job completed earlier (respectively, later) than the common due-window of the group it belongs to will incur an earliness (respectively, tardiness) penalty. The objective is to determine the optimal group sequence, the optimal job sequence, and the optimal due-window assignment so as to minimize the total cost including the earliness and tardiness (or weighted number of tardy jobs) penalties, black and the due-window starting time and due-window size costs. We show that both the problems can be solved in polynomial times.

Common Due Window Assignment Scheduling with Proportional Linear Deterioration Effects

2020 ◽  
Vol 37 (01) ◽  
pp. 1950031
Author(s):  
Xue Huang ◽  
Na Yin ◽  
Wei-Wei Liu ◽  
Ji-Bo Wang
Keyword(s):  
Window Size ◽  
Single Machine Scheduling ◽  
Scheduling Problems ◽  
Polynomial Time Algorithms ◽  
Linear Deterioration ◽  
Optimality Properties ◽  
Due Window ◽  
Tardy Jobs ◽  
Machine Scheduling Problems ◽  
Due Window Assignment

In this paper, single-machine scheduling problems with proportional linear deterioration effects and common due window assignment simultaneously are considered. Two different objective functions are studied, the first is to minimize the sum of the number of early jobs, number of tardy jobs and due window location and due window size, the second is to minimize the sum of the earliness cost, tardiness cost, due window location and due window size. Optimality properties for all problems are provided and polynomial time algorithms for solving these problems are given.

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