Parallel-Machine Scheduling with Delivery Times and Deteriorating Maintenance

2015 ◽  
Vol 32 (04) ◽  
pp. 1550029 ◽  
Author(s):  
Wei-Min Ma ◽  
Li Sun ◽  
S. C. Liu ◽  
T. H. Wu
Keyword(s):  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Absolute Deviation ◽  
Total Load ◽  
Delivery Times ◽  
Polynomial Time Algorithms ◽  
Deteriorating Maintenance ◽  
Time Required ◽  
Completion Times

In this paper, we consider parallel-machine scheduling with past-sequence-dependent (p-s-d) delivery times and deteriorating maintenance. The delivery time of a job is proportional to its waiting time in the system. Each machine has a deteriorating maintenance activity, i.e., delaying the maintenance increases the time required to perform it. We consider three versions of the problem to minimize the total absolute deviation of job completion times, the total load on all the machines, and the total completion time. We develop polynomial-time algorithms to solve them.

scholarly journals Parallel-Machine Scheduling with DeJong’s Learning Effect, Delivery Times, Rate-Modifying Activity, and Resource Allocation

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Li Sun ◽  
Bin Wu ◽  
Lei Ning
Keyword(s):  
Resource Allocation ◽  
Learning Effect ◽  
Waiting Times ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Absolute Deviation ◽  
Delivery Times ◽  
Completion Times ◽  
Total Resource

We investigate parallel-machine scheduling with past-sequence-dependent (p-s-d) delivery times, DeJong’s learning effect, rate-modifying activity, and resource allocation. Each machine has a rate-modifying activity. We consider two versions of the problem to minimize the sum of the total completion times, the total absolute deviation of job completion times, and the total resource allocation and the sum of the total waiting times, the total absolute deviation of job waiting times, and the total resource allocation, respectively. The problems under our present model can be solved in polynomial time.

scholarly journals Parallel-Machine Scheduling Problems with Past-Sequence-Dependent Delivery Times and Aging Maintenance

2015 ◽  
Vol 2015 ◽  
pp. 1-6 ◽  
Author(s):  
Wei-min Ma ◽  
Li Sun ◽  
Xue-qin Zeng ◽  
Lei Ning
Keyword(s):  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Polynomial Algorithms ◽  
Scheduling Problems ◽  
Absolute Deviation ◽  
Total Load ◽  
Delivery Times ◽  
Sequence Dependent ◽  
Machine Scheduling Problems

We consider parallel-machine scheduling problems with past-sequence-dependent (psd) delivery times and aging maintenance. The delivery time is proportional to the waiting time in the system. Each machine has an aging maintenance activity. We develop polynomial algorithms to three versions of the problem to minimize the total absolute deviation of job completion times, the total load, and the total completion time.

Unrelated Parallel-Machine Scheduling with Deteriorating Jobs and Rejection

2012 ◽  
Vol 263-266 ◽  
pp. 655-659 ◽  
Author(s):  
Chou Jung Hsu ◽  
Chia Wen Chang
Keyword(s):  
Completion Time ◽  
Deteriorating Jobs ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Unrelated Parallel Machine ◽  
Absolute Deviation ◽  
Total Load ◽  
Unrelated Parallel Machine Scheduling ◽  
Total Penalty

This paper aimed to investigate the unrelated parallel-machine scheduling with deteriorating jobs and rejection. The objective is to find the rejected jobs, the non-rejected jobs, and the optimal non-rejected job sequence so that the cost function that includes the weighted of total load, total completion time, and total absolute deviation of completion time plus the total penalty of the rejected jobs would be minimized. Results showed that the problem is polynomial time solvable when the number of machine is fixed.

scholarly journals Results of Parallel-Machine Scheduling Model with Maintenance Activity considering Time-Dependent Deterioration, Delivery Times, and Resource Allocation

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Li Sun ◽  
Xiao-hong Zhang ◽  
Lei Ning
Keyword(s):  
Resource Allocation ◽  
Waiting Times ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Time Dependent ◽  
Absolute Deviation ◽  
Maintenance Activity ◽  
Delivery Times ◽  
Completion Times ◽  
Total Resource

This paper investigates parallel-machine scheduling models with maintenance activity, delivery times, time-dependent deterioration, and resource allocation. We consider two forms of the problem: the first is to minimize the sum of total completion times, total machine loads, the total absolute deviation of job completion times, and the total resource allocation; the second is to minimize the sum of total waiting times, total machine loads, the total absolute deviation of job waiting times, and the total resource allocation. The problems are proved to be solvable in polynomial time.

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.

scholarly journals A note on parallel-machine scheduling with controllable processing times and job-dependent learning effects

2021 ◽  
Vol 55 (2) ◽  
pp. 561-569
Author(s):  
Shan-Shan Lin
Keyword(s):  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Single Machine Scheduling ◽  
Controllable Processing Times ◽  
Learning Effects ◽  
Scheduling Problems ◽  
Total Load ◽  
Processing Times ◽  
Dependent Learning

This note studies a unrelated parallel-machine scheduling problem with controllable processing times and job-dependent learning effects, where the objective function is to minimize the weighted sum of total completion time, total load, and total compression cost. We show that the problem can be solved in O(nm+2) time, where m and n are the numbers of machines and jobs. We also show how to apply the technique to several single-machine scheduling problems with total criteria.

scholarly journals Uniform Parallel Machine Scheduling Problem with Controllable Delivery Times

2015 ◽  
Vol 3 (6) ◽  
pp. 525-537
Author(s):  
Kai Li ◽  
Hui Li ◽  
Bayi Cheng ◽  
Qing Luo
Keyword(s):  
Resource Allocation ◽  
Heuristic Algorithm ◽  
Large Scale ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Scheduling Problem ◽  
Delivery Times ◽  
Parallel Machine Scheduling Problem ◽  
Uniform Parallel Machine Scheduling

AbstractThis paper considers the uniform parallel machine scheduling problem with controllable delivery times, which assumes that the delivery times of jobs are linear decreasing functions of the consumed resource. It aims to minimize the maximum completion time under the constraint that the total resource consumption does not exceed a given limit. For this NP-hard problem, we propose a resource allocation algorithm, named RAA, according to the feasible solution of the uniform parallel machine scheduling problem with fixed delivery times. It proves that RAA algorithm can obtain the optimal resource allocation scheme for any given scheduling scheme inO(nlogn)time. Some algorithms based on heuristic algorithm LDT, heuristic algorithm LPDT and simulated annealing are proposed to solve the uniform parallel machine scheduling problem with controllable delivery times. The accuracy and efficiency of the proposed algorithms are tested based on those data with problem sizes varying from 40 to 200 jobs and 2 to 8 machines. The computational results indicate that the SA approach is promising and capable of solving large-scale problems in a reasonable time.

Sign in / Sign up

Export Citation Format

Share Document