Scheduling a deteriorating maintenance activity and due-window assignment

2015 ◽  
Vol 57 ◽  
pp. 33-40 ◽  
Author(s):  
Baruch Mor ◽  
Gur Mosheiov
Keyword(s):  
Maintenance Activity ◽  
Deteriorating Maintenance ◽  
Due Window ◽  
Due Window Assignment

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.

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.

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.

Sign in / Sign up

Export Citation Format

Share Document