An FPTAS for Uniform Parallel-Machine Scheduling Problem with Deteriorating Jobs and Rejection

Parallel Machine ◽

Scheduling Problem ◽

Total Load ◽

Penalty Cost ◽

This paper studies uniform parallel-machine scheduling problem with deteriorating jobs and rejection. The processing time of each job is a linear nondecreasing function of its starting time. A job can be rejected by paying a penalty cost. The objective is to minimize the sum of the total load of the accepted jobs on all machines and the total rejection penalties of the rejected jobs. We propose a fully polynomial-time approximation scheme (FPTAS) for this problem.

Lecture Notes in Mechanical Engineering - Proceedings of the International Symposium for Production Research 2019 ◽

The Uniform Parallel Machine Scheduling Problem: A Case Study

10.1007/978-3-030-31343-2_69 ◽

2019 ◽

pp. 839-850

Author(s):

Ege Duran ◽

Gizem Görgülü ◽

Ayben Pınar Kuruç ◽

İpek Gülhan ◽

Murat Can Doğruyol ◽

...

Keyword(s):

Machine Scheduling ◽

Parallel Machine ◽

Scheduling Problem ◽

An effective estimation of distribution algorithm for solving uniform parallel machine scheduling problem with precedence constraints

2016 IEEE Congress on Evolutionary Computation (CEC) ◽

10.1109/cec.2016.7744117 ◽

2016 ◽

Cited By ~ 4

Author(s):

Chu-ge Wu ◽

Ling Wang ◽

Xiao-long Zheng

Keyword(s):

Machine Scheduling ◽

Parallel Machine ◽

Estimation Of Distribution Algorithm ◽

Precedence Constraints ◽

Scheduling Problem ◽

Estimation Of Distribution ◽

Uniform Parallel Machine Scheduling Problem with Controllable Delivery Times

Journal of Systems Science and Information ◽

10.1515/jssi-2015-0525 ◽

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 Problem ◽

Delivery Times ◽

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.