Parallel machines scheduling with a deteriorating maintenance activity

2011 ◽  
Vol 62 (10) ◽  
pp. 1898-1902 ◽  
Author(s):  
J-J Wang ◽  
J-B Wang ◽  
F Liu
Keyword(s):  
Parallel Machines ◽  
Maintenance Activity ◽  
Parallel Machines Scheduling ◽  
Deteriorating Maintenance

Unrelated Parallel-Machine Scheduling with Controllable Processing Times and Impact of Deteriorating Maintenance Activities under Consideration

2016 ◽  
Vol 33 (01) ◽  
pp. 1650001 ◽  
Author(s):  
Chun-Lai Liu ◽  
Jian-Jun Wang
Keyword(s):  
Processing Time ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Controllable Processing Times ◽  
Maintenance Activity ◽  
Processing Times ◽  
Unrelated Parallel Machine Scheduling ◽  
Deteriorating Maintenance ◽  
Maintenance Activities

In this paper, we study the problem of unrelated parallel machine scheduling with controllable processing times and deteriorating maintenance activity. The jobs are nonresumable. The processing time of each job is a linear function of the amount of a continuously divisible resource allocated to the job. During the planning horizon, there is at most one maintenance activity scheduled on each machine. Additionally, if the starting time of maintenance activity is delayed, the length of the maintenance activity required to perform will increase. Considering the total completion times of all jobs, the impact of maintenance activity in the form of the variation in machine load and the amounts of compression, we need to determine the job sequence on each machine, the location of maintenance activities and processing time compression of each job simultaneously. Accordingly, a polynomial time solution to the problem is provided.

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.

A Bicriteria Approach for Single Machine Scheduling with Resource Allocation, Learning Effect and a Deteriorating Maintenance Activity

2017 ◽  
Vol 34 (04) ◽  
pp. 1750011 ◽  
Author(s):  
Zhusong Liu ◽  
Zhenyou Wang ◽  
Yuan-Yuan Lu
Keyword(s):  
Resource Allocation ◽  
Single Machine ◽  
Learning Effect ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Maintenance Activity ◽  
Optimal Resource ◽  
Deteriorating Maintenance ◽  
Polynomially Solvable ◽  
Completion Times

This paper considers the single machine scheduling with learning effect, resource allocation and deteriorating maintenance activity simultaneously. For the convex resource allocation consumption function, we provide a bicriteria analysis where the first (schedule) criterion is to minimize the total weighted sum of makespan, total completion time and total absolute differences in completion times, and the second (resource) criterion is to minimize the total weighted resource consumption. Our aim is to find the optimal resource allocations and job sequence that minimize the three different models of considering the two criterion. We show that these three models are polynomially solvable respectively.

Sign in / Sign up

Export Citation Format

Share Document