scholarly journals Randomized priority algorithms

2010 ◽  
Vol 411 (26-28) ◽  
pp. 2542-2558 ◽  
Author(s):  
Spyros Angelopoulos ◽  
Allan Borodin
Keyword(s):  
Priority Algorithms

scholarly journals Priority algorithms for graph optimization problems

2010 ◽  
Vol 411 (1) ◽  
pp. 239-258 ◽  
Author(s):  
Allan Borodin ◽  
Joan Boyar ◽  
Kim S. Larsen ◽  
Nazanin Mirmohammadi
Keyword(s):  
Optimization Problems ◽  
Priority Algorithms ◽  
Graph Optimization

scholarly journals Analysis of the job shop system with transport and setup times in deadlock-free operating conditions

2012 ◽  
Vol 22 (4) ◽  
pp. 417-425 ◽  
Author(s):  
Jolanta Krystek ◽  
Marek Kozik
Keyword(s):  
Comparative Research ◽  
Completion Time ◽  
Job Shop ◽  
Optimization Criterion ◽  
Operating Conditions ◽  
Setup Times ◽  
Automated Guided Vehicles ◽  
Transport Time ◽  
Priority Algorithms

This paper presents a generalized job-shop problem taking into consideration transport time between workstations and setups machines in deadlock-free operating conditions. The automated transportation system, employing a number of automated guided vehicles is considered. The completion time of all jobs was applied as the optimization criterion. The created computational application was used to solve this problem in which chosen priority algorithms (FIFO, LIFO, LPT, SPT, EDD and LWR) were implemented. Various criteria were used to assess the quality of created schedules. Numerical results of the comparative research were presented for various criteria and rules of the priority

scholarly journals Advice Complexity of Priority Algorithms

2018 ◽  
pp. 69-86 ◽  
Author(s):  
Allan Borodin ◽  
Joan Boyar ◽  
Kim S. Larsen ◽  
Denis Pankratov
Keyword(s):  
Advice Complexity ◽  
Priority Algorithms

A Review of Hierarchical Fixed Priority Scheduling

2014 ◽  
Vol 536-537 ◽  
pp. 566-569
Author(s):  
Feng Xiang Zhang
Keyword(s):  
Real Time ◽  
Schedulability Analysis ◽  
Priority Scheduling ◽  
Scheduling Policies ◽  
Fixed Priority ◽  
Fixed Priority Scheduling ◽  
Priority Algorithms ◽  
Priority Systems ◽  
Real Time Applications ◽  
Global And Local

This paper focus on two level hierarchical scheduling where several real-time applications are scheduled by the fixed priority algorithms. The application with its real-time tasks is bound to a server which can be modeled as a sporadic task with special care for the schedulability analysis. Different scheduling policies and servers can be applied for hierarchical fixed priority systems, this paper gives a closer review of schedulability analysis for applications and tasks when the global and local schedulers of a system are fixed priority.

scholarly journals Advice Complexity of Priority Algorithms

2019 ◽  
Vol 64 (4) ◽  
pp. 593-625
Author(s):  
Allan Borodin ◽  
Joan Boyar ◽  
Kim S. Larsen ◽  
Denis Pankratov
Keyword(s):  
Advice Complexity ◽  
Priority Algorithms
Sign in / Sign up

Export Citation Format

Share Document