job migration
Recently Published Documents


TOTAL DOCUMENTS

48
(FIVE YEARS 10)

H-INDEX

9
(FIVE YEARS 0)

Algorithmica ◽  
2021 ◽  
Author(s):  
Matthias Englert ◽  
David Mezlaf ◽  
Matthias Westermann

AbstractIn the classic minimum makespan scheduling problem, we are given an input sequence of n jobs with sizes. A scheduling algorithm has to assign the jobs to m parallel machines. The objective is to minimize the makespan, which is the time it takes until all jobs are processed. In this paper, we consider online scheduling algorithms without preemption. However, we allow the online algorithm to change the assignment of up to k jobs at the end for some limited number k. For m identical machines, Albers and Hellwig (Algorithmica 79(2):598–623, 2017) give tight bounds on the competitive ratio in this model. The precise ratio depends on, and increases with, m. It lies between 4/3 and $$\approx 1.4659$$ ≈ 1.4659 . They show that $$k = O(m)$$ k = O ( m ) is sufficient to achieve this bound and no $$k = o(n)$$ k = o ( n ) can result in a better bound. We study m uniform machines, i.e., machines with different speeds, and show that this setting is strictly harder. For sufficiently large m, there is a $$\delta = \varTheta (1)$$ δ = Θ ( 1 ) such that, for m machines with only two different machine speeds, no online algorithm can achieve a competitive ratio of less than $$1.4659 + \delta $$ 1.4659 + δ with $$k = o(n)$$ k = o ( n ) . We present a new algorithm for the uniform machine setting. Depending on the speeds of the machines, our scheduling algorithm achieves a competitive ratio that lies between 4/3 and $$\approx 1.7992$$ ≈ 1.7992 with $$k = O(m)$$ k = O ( m ) . We also show that $$k = \varOmega (m)$$ k = Ω ( m ) is necessary to achieve a competitive ratio below 2. Our algorithm is based on maintaining a specific imbalance with respect to the completion times of the machines, complemented by a bicriteria approximation algorithm that minimizes the makespan and maximizes the average completion time for certain sets of machines.


2021 ◽  
Author(s):  
Hein Htet ◽  
Nobuo Funabiki ◽  
Ariel Kamoyedji ◽  
Xudong Zhou ◽  
Minoru Kuribayashi

This study utilized the logit regression model with data from the Vietnamese Household Living Standards Survey (VHLSS) in 2016 to discover key factors that determined the probability of job migration in Vietnam. The estimated results of the model indicated that there were seven factors affecting job migration of households including the proportion of people with high school or higher qualification, the proportion of dependents, the number of males, the rate of income from non-agricultural fields, ethnics, areas and households’ living standards compared to the previous five years. In particular, the rate of non-agricultural income had a positive impact on households’ job migration, while other factors had negative effects on households’ job migration. Households’ accommodations and living standards had made great impacts on households whose family members working far away from home and even being helpers.


2019 ◽  
Vol 30 (12) ◽  
pp. 2718-2729
Author(s):  
Javier Prades ◽  
Federico Silla
Keyword(s):  

2019 ◽  
Vol 75 (10) ◽  
pp. 6517-6541
Author(s):  
Manuel Rodríguez-Pascual ◽  
Jiajun Cao ◽  
José A. Moríñigo ◽  
Gene Cooperman ◽  
Rafael Mayo-García
Keyword(s):  

2019 ◽  
Author(s):  
Robert Fletcher ◽  
Santiago Saavedra
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document