scholarly journals A multi-agent scheduling problem for two identical parallel machines to minimize total tardiness time and makespan

2018 ◽  
Vol 10 (2) ◽  
pp. 168781401875610 ◽  
Author(s):  
Fei Yu ◽  
Peihan Wen ◽  
Shuping Yi
Keyword(s):  
Parallel Machines ◽  
Total Tardiness ◽  
Scheduling Problem ◽  
Identical Parallel Machines ◽  
Agent Scheduling ◽  
Multi Agent

Multithreading MAS Platform for Real-Time Scheduling

2016 ◽  
Vol 4 (1) ◽  
pp. 48-60 ◽  
Author(s):  
Yaroslav Shepilov ◽  
Daria Pavlova ◽  
Daria Kazanskaia
Keyword(s):  
Real Time ◽  
Scheduling Problem ◽  
Optimal Resource Allocation ◽  
Dynamic Changes ◽  
Real Time Scheduling ◽  
Fast Solution ◽  
Agent Scheduling ◽  
Time Scheduling ◽  
Optimal Resource ◽  
Multi Agent

The scheduling is the process of the optimal resource allocation that is widely used both in everyday life and specific domains. In the paper the description of scheduling problem is given. The authors consider traditional methods and tools for solving this problem, then describe the proposed approach based on multi-agent technologies and multithreading application. Nowadays there exist numerous approaches to solving of the scheduling problem. In the most of cases this process has to be supported and managed by the complex tools, sometimes based on mathematical principles. The suggested method of multithreading multi-agent scheduling allows efficient and fast solution of complex problems in real-time featuring rapid dynamic changes and uncertainty that cannot be handled by the other methods and tools.

An Optimal Preemptive Algorithm for the Single-Server Parallel-Machine Scheduling with Loading and Unloading Times

2014 ◽  
Vol 31 (05) ◽  
pp. 1450039 ◽  
Author(s):  
Yiwei Jiang ◽  
Huijuan Wang ◽  
Ping Zhou
Keyword(s):  
Parallel Machines ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Solution Algorithm ◽  
Single Server ◽  
Preemptive Scheduling ◽  
Scheduling Problem ◽  
Identical Parallel Machines ◽  
Loading And Unloading

We study a preemptive scheduling problem on two identical parallel machines that share a common server. Each job has to be loaded by the server before being processed on one of the machines and unloaded by the server after its processing. The loading and unloading times are both equal to one time unit. The goal is to minimize the makespan. We propose a O(n log n) solution algorithm for the preemptive variant of the problem.

Sign in / Sign up

Export Citation Format

Share Document