Competitive algorithm for scheduling of sharing machines with rental discount

Author(s):  
Yinfeng Xu ◽  
Rongteng Zhi ◽  
Feifeng Zheng ◽  
Ming Liu
2018 ◽  
Vol 11 (1) ◽  
pp. 57 ◽  
Author(s):  
Dieu Tien Bui ◽  
Himan Shahabi ◽  
Ataollah Shirzadi ◽  
Kamran Kamran Chapi ◽  
Nhat-Duc Hoang ◽  
...  

The authors wish to make the following corrections to this paper [...]


2013 ◽  
Vol 219 (17) ◽  
pp. 8829-8841 ◽  
Author(s):  
Rasul Enayatifar ◽  
Moslem Yousefi ◽  
Abdul Hanan Abdullah ◽  
Amer Nordin Darus

2021 ◽  
Vol 52 (2) ◽  
pp. 71-71
Author(s):  
Rob van Stee

For this issue, Pavel Vesely has contributed a wonderful overview of the ideas that were used in his SODA paper on packet scheduling with Marek Chrobak, Lukasz Jez and Jiri Sgall. This is a problem for which a 2-competitive algorithm as well as a lower bound of ϕ ≈ 1:618 was known already twenty years ago, but which resisted resolution for a long time. It is great that this problem has nally been resolved and that Pavel was willing to explain more of the ideas behind it for this column. He also provides an overview of open problems in this area.


2021 ◽  
Vol 52 (2) ◽  
pp. 72-84
Author(s):  
Pavel Veselý

Online packet scheduling with deadlines is one of the fundamental models in buffer management. Recently, the author together with Chrobak, Jez, and Sgall (SODA 2019) designed an optimal ϕ-competitive algorithm for this problem, where ϕ ≈1.618 is the golden ratio. In this column, we sketch ideas that led us to the development of this algorithm and outline the concepts in its analysis. We also highlight open questions in packet scheduling.


2012 ◽  
Vol 166-169 ◽  
pp. 493-496
Author(s):  
Roya Kohandel ◽  
Behzad Abdi ◽  
Poi Ngian Shek ◽  
M.Md. Tahir ◽  
Ahmad Beng Hong Kueh

The Imperialist Competitive Algorithm (ICA) is a novel computational method based on the concept of socio-political motivated strategy, which is usually used to solve different types of optimization problems. This paper presents the optimization of cold-formed channel section subjected to axial compression force utilizing the ICA method. The results are then compared to the Genetic Algorithm (GA) and Sequential Quadratic Programming (SQP) algorithm for validation purpose. The results obtained from the ICA method is in good agreement with the GA and SQP method in terms of weight but slightly different in the geometry shape.


2011 ◽  
Vol 110-116 ◽  
pp. 3422-3428 ◽  
Author(s):  
Behzad Abdi ◽  
Hamid Mozafari ◽  
Ayob Amran ◽  
Roya Kohandel

This work devoted to an ellipsoidal head of pressure vessel under internal pressure load. The analysis is aimed at finding an optimum weight of ellipsoidal head of pressure vessel due to maximum working pressure that ensures its full charge with stresses by using imperialist competitive algorithm and genetic algorithm. In head of pressure vessel the region of its joint with the cylindrical shell is loaded with shear force and bending moments. The load causes high bending stresses in the region of the joint. Therefore, imperialist competitive algorithm was used here to find the optimum shape of a head with minimum weight and maximum working pressure which the shear force and the bending moment moved toward zero. Two different size ellipsoidal head examples are selected and studied. The imperialist competitive algorithm results are compared with the genetic algorithm results.


Sign in / Sign up

Export Citation Format

Share Document