An Agent Based Heuristic Algorithm for Uniform Parallel Machine Scheduling Problem with Tails

2010 ◽  
Author(s):  
Kai Li ◽  
Ba-Yi Cheng
Keyword(s):  
Heuristic Algorithm ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Scheduling Problem ◽  
Agent Based ◽  
Parallel Machine Scheduling Problem ◽  
Uniform Parallel Machine Scheduling

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.

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

2013 ◽  
Vol 433-435 ◽  
pp. 2335-2338
Author(s):  
Cheng Xin Luo
Keyword(s):  
Deteriorating Jobs ◽  
Nondecreasing Function ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Scheduling Problem ◽  
Total Load ◽  
Penalty Cost ◽  
Parallel Machine Scheduling Problem ◽  
Uniform Parallel Machine Scheduling

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.

An Optimization Approach to Solve a Multi-Objective Unrelated Parallel Machine Scheduling Problem

2014 ◽  
Vol 564 ◽  
pp. 585-589 ◽  
Author(s):  
S. Sadeghi ◽  
Shahram Ariafar ◽  
M. Ghanbari ◽  
N. Ismail
Keyword(s):  
Heuristic Algorithm ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Scheduling Problem ◽  
Unrelated Parallel Machine ◽  
Solution Approach ◽  
Multi Objective ◽  
Unrelated Parallel Machine Scheduling ◽  
Parallel Machine Scheduling Problem

In this study, a multi-objective optimization method for an unrelated parallel machine scheduling problem was addressed. The model, simultaneously takes into account the minimization of makespan and machine utilization cost. Then, because of the complexity of the problem, a heuristic algorithm will be developed to solve the mathematical model. To show the validity of the model, and also solution approach, a case will be randomly generated, and solved by the heuristic algorithm and also Lingo optimization software. The results show the validity of the model and also solution approach.

Sign in / Sign up

Export Citation Format

Share Document