Journal articles: 'Job distribution'

1

Chentsov, P. A. "Job distribution algorithms." Automation and Remote Control 67, no. 8 (August 2006): 1251–64. http://dx.doi.org/10.1134/s0005117906080054.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Ko, Sung-Seok, and Richard F. Serfozo. "Response times in M/M/s fork-join networks." Advances in Applied Probability 36, no. 03 (September 2004): 854–71. http://dx.doi.org/10.1017/s000186780001315x.

Full text

Abstract:

We study a fork-join processing network in which jobs arrive according to a Poisson process and each job splits into m tasks, which are simultaneously assigned to m nodes that operate like M/M/s queueing systems. When all of its tasks are finished, the job is completed. The main result is a closed-form formula for approximating the distribution of the network's response time (the time to complete a job) in equilibrium. We also present an analogous approximation for the distribution of the equilibrium queue length (the number of jobs in the system), when each node has one server. Kolmogorov-Smirnov statistical tests show that these formulae are good fits for the distributions obtained from simulations.

APA, Harvard, Vancouver, ISO, and other styles

3

Ko, Sung-Seok, and Richard F. Serfozo. "Response times in M/M/s fork-join networks." Advances in Applied Probability 36, no. 3 (September 2004): 854–71. http://dx.doi.org/10.1239/aap/1093962238.

Full text

Abstract:

We study a fork-join processing network in which jobs arrive according to a Poisson process and each job splits into m tasks, which are simultaneously assigned to m nodes that operate like M/M/s queueing systems. When all of its tasks are finished, the job is completed. The main result is a closed-form formula for approximating the distribution of the network's response time (the time to complete a job) in equilibrium. We also present an analogous approximation for the distribution of the equilibrium queue length (the number of jobs in the system), when each node has one server. Kolmogorov-Smirnov statistical tests show that these formulae are good fits for the distributions obtained from simulations.

APA, Harvard, Vancouver, ISO, and other styles

4

Hyatt, Henry R., and James R. Spletzer. "The shifting job tenure distribution." Labour Economics 41 (August 2016): 363–77. http://dx.doi.org/10.1016/j.labeco.2016.05.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Xu, Susan H. "Stochastically Minimizing Total Delay of Jobs Subject to Random Deadlines." Probability in the Engineering and Informational Sciences 5, no. 3 (July 1991): 333–48. http://dx.doi.org/10.1017/s0269964800002126.

Full text

Abstract:

This paper analyzes a scheduling system where a fixed number of nonpreemptive jobs is to be processed on multiple parallel processors with different processing speeds. Each processor has an exponential processing time distribution and the processors are ordered in ascending order of their mean processing times. Each job has its own deadline that is exponentially distributed with rate ß1, independent of the deadlines of other jobs and also independent of job processing times. A job departs the system as soon as either its processing completes or its deadline occurs. We show that there exists a simple threshold strategy that slochastically minimizes the total delay of all jobs. The policy depends on distributions of processing times and deadlines, but is independent of the rate of deadlines. When the rate of the deadline distribution is 0 (no deadlines), the total delay reduces to the flowtime (the sum of completion times of all jobs). If each job has its own probability of being correctly processed, then an extension of this policy stochastically maximizes the total number of correctly processed, nontardy jobs. We discuss possible generalizations and limitations of this result.

APA, Harvard, Vancouver, ISO, and other styles

6

Harchol-Balter, Mor, and Rein Vesilo. "TO BALANCE OR UNBALANCE LOAD IN SIZE-INTERVAL TASK ALLOCATION." Probability in the Engineering and Informational Sciences 24, no. 2 (March 18, 2010): 219–44. http://dx.doi.org/10.1017/s0269964809990246.

Full text

Abstract:

Server farms, consisting of a collection of hosts and a front-end router that dispatches incoming jobs to hosts, are now commonplace. It is well known that when job service requirements (job sizes) are highly variable, then the Size-Interval task assignment policy is an excellent rule for assigning jobs to hosts, since it provides isolation for short jobs by directing short jobs to one host's queue and long jobs to another host's queue. What is not understood is how to classify a “short” job versus a “long” job. For a long time it was believed that the size cutoff separating “short” jobs from “long” ones should be chosen to balance the load at the hosts in the server farm. However, recent literature has provided empirical evidence that load balancing is not always optimal for minimizing mean response time. This article provides the first analytical criteria for when it is preferable to unbalance load between two hosts using Size-Interval task assignment and in which direction the load should be unbalanced. Some very simple sufficient criteria are provided under which we prove that the short job host should be underloaded, and likewise for the long job host. These criteria are then used to prove that the direction of load imbalance depends on moment index properties related to the job size distribution. For example, under the Bounded Pareto (BP) job size distribution with parameter α and a sufficiently high upper bound (the BP is well known to be a good model of empirical computer system workloads), we show that α determines the direction of load imbalance. For α<1, the short job host should be underloaded; for α=1, load should be balanced; and for α>1, the long job host should be underloaded. Many other job size distributions are considered as well. We end by showing that load unbalancing can have a dramatic impact on performance, reducing mean response time by an order of magnitude compared to load balancing in many common cases.

APA, Harvard, Vancouver, ISO, and other styles

7

Li, Wei, W. John Braun, and Yiqiang Q. Zhao. "Stochastic scheduling on a repairable machine with Erlang uptime distribution." Advances in Applied Probability 30, no. 04 (December 1998): 1073–88. http://dx.doi.org/10.1017/s0001867800008806.

Full text

Abstract:

A set of jobs is to be processed on a machine which is subject to breakdown and repair. When the processing of a job is interrupted by a machine breakdown, the processing later resumes at the point at which the breakdown occurred. We assume that the machine uptime is Erlang distributed and that processing and repair times follow general distributions. Simple permutation policies on both machine parameters and the processing distributions are given which minimize the weighted number of tardy jobs, weighted flow times and the weighted sum of the job delays.

APA, Harvard, Vancouver, ISO, and other styles

8

Li, Wei, W. John Braun, and Yiqiang Q. Zhao. "Stochastic scheduling on a repairable machine with Erlang uptime distribution." Advances in Applied Probability 30, no. 4 (December 1998): 1073–88. http://dx.doi.org/10.1239/aap/1035228208.

Full text

Abstract:

A set of jobs is to be processed on a machine which is subject to breakdown and repair. When the processing of a job is interrupted by a machine breakdown, the processing later resumes at the point at which the breakdown occurred. We assume that the machine uptime is Erlang distributed and that processing and repair times follow general distributions. Simple permutation policies on both machine parameters and the processing distributions are given which minimize the weighted number of tardy jobs, weighted flow times and the weighted sum of the job delays.

APA, Harvard, Vancouver, ISO, and other styles

9

Hamermesh, Daniel S. "The Changing Distribution of Job Satisfaction." Journal of Human Resources 36, no. 1 (2001): 1. http://dx.doi.org/10.2307/3069668.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Rakhra, Manik. "Optimizing Job distribution for load reduction." IOSR Journal of Engineering 4, no. 1 (January 2014): 38–41. http://dx.doi.org/10.9790/3021-04123841.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Moon, Ilkyeong, and Wonyoung Yun. "The distribution free job control problem." Computers & Industrial Engineering 32, no. 1 (January 1997): 109–13. http://dx.doi.org/10.1016/s0360-8352(96)00200-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Moscarini, Giuseppe. "Job Matching and the Wage Distribution." Econometrica 73, no. 2 (March 2005): 481–516. http://dx.doi.org/10.1111/j.1468-0262.2005.00586.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Withey, John J. "Job assignments in physical distribution organizations." International Journal of Physical Distribution & Logistics Management 27, no. 5/6 (July 1997): 274–81. http://dx.doi.org/10.1108/eum0000000004331.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Renes, Gusta, and Aldi Hagenaars. "The perceived distribution of job characteristics." European Economic Review 33, no. 4 (April 1989): 845–62. http://dx.doi.org/10.1016/0014-2921(89)90030-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Galambos, Janos, and Charles Hagwood. "An unreliable server characterization of the exponential distribution." Journal of Applied Probability 31, no. 1 (March 1994): 274–79. http://dx.doi.org/10.2307/3215255.

Full text

Abstract:

Consider a workstation with one server, performing jobs with a service time, Y, having distribution function, G(t). Assume that the station is unreliable, in that it occasionally breaks down. The station is instantaneously repaired, and the server restarts the uncompleted job from the beginning. Let T denote the time it takes to complete each job. If G(t) is exponential with parameter A, then because of the lack-of-memory property of the exponential, P (T > t) = Ḡ(t) =exp(−γt), irrespective of when and how the failures occur. This property also characterizes the exponential distribution.

APA, Harvard, Vancouver, ISO, and other styles

16

Galambos, Janos, and Charles Hagwood. "An unreliable server characterization of the exponential distribution." Journal of Applied Probability 31, no. 01 (March 1994): 274–79. http://dx.doi.org/10.1017/s0021900200107533.

Full text

Abstract:

Consider a workstation with one server, performing jobs with a service time, Y, having distribution function, G(t). Assume that the station is unreliable, in that it occasionally breaks down. The station is instantaneously repaired, and the server restarts the uncompleted job from the beginning. Let T denote the time it takes to complete each job. If G(t) is exponential with parameter A, then because of the lack-of-memory property of the exponential, P (T > t) = Ḡ(t) =exp(−γt), irrespective of when and how the failures occur. This property also characterizes the exponential distribution.

APA, Harvard, Vancouver, ISO, and other styles

17

Pinedo, Michael, and Zvi Schechner. "Inequalities and bounds for the scheduling of stochastic jobs on parallel machines." Journal of Applied Probability 22, no. 3 (September 1985): 739–44. http://dx.doi.org/10.2307/3213879.

Full text

Abstract:

Consider n jobs and m machines. The m machines are identical and set up in parallel. All n jobs are available at t = 0 and each job has to be processed on one of the machines; any one can do. The processing time of job j is Xj, a random variable with distribution Fj. The sequence in which the jobs start with their processing is predetermined and preemptions are not allowed. We investigate the effect of the variability of the processing times on the expected makespan and the expected time to first idleness. Bounds are presented for these quantities in case the distributions of the processing times of the jobs are new better (worse) than used.

APA, Harvard, Vancouver, ISO, and other styles

18

Pinedo, Michael, and Zvi Schechner. "Inequalities and bounds for the scheduling of stochastic jobs on parallel machines." Journal of Applied Probability 22, no. 03 (September 1985): 739–44. http://dx.doi.org/10.1017/s002190020002951x.

Full text

Abstract:

Consider n jobs and m machines. The m machines are identical and set up in parallel. All n jobs are available at t = 0 and each job has to be processed on one of the machines; any one can do. The processing time of job j is Xj , a random variable with distribution Fj. The sequence in which the jobs start with their processing is predetermined and preemptions are not allowed. We investigate the effect of the variability of the processing times on the expected makespan and the expected time to first idleness. Bounds are presented for these quantities in case the distributions of the processing times of the jobs are new better (worse) than used.

APA, Harvard, Vancouver, ISO, and other styles

19

Kielanski, Grzegorz, and Benny Van Houdt. "On the Asymptotic Insensitivity of the Supermarket Model in Processor Sharing Systems." Proceedings of the ACM on Measurement and Analysis of Computing Systems 5, no. 2 (June 2021): 1–28. http://dx.doi.org/10.1145/3460089.

Full text

Abstract:

The supermarket model is a popular load balancing model where each incoming job is assigned to a server with the least number of jobs among d randomly selected servers. Several authors have shown that the large scale limit in case of processor sharing servers has a unique insensitive fixed point, which naturally leads to the belief that the queue length distribution in such a system is insensitive to the job size distribution as the number of servers tends to infinity. Simulation results that support this belief have also been reported. However, global attraction of the unique fixed point of the large scale limit was not proven except for exponential job sizes, which is needed to formally prove asymptotic insensitivity. The difficulty lies in the fact that with processor sharing servers, the limiting system is in general not monotone. In this paper we focus on the class of hyperexponential distributions of order 2 and demonstrate that for this class of distributions global attraction of the unique fixed point can still be established using monotonicity by picking a suitable state space and partial order. This allows us to formally show that we have asymptotic insensitivity within this class of job size distributions. We further demonstrate that our result can be leveraged to prove asymptotic insensitivity within this class of distributions for other load balancing systems.

APA, Harvard, Vancouver, ISO, and other styles

20

Yamazaki, Genji. "QUASI-PRODUCT FORM TO A MULTINODE QUEUEING SYSTEM SHARING A STATE-DEPENDENT SETUP SERVER." Probability in the Engineering and Informational Sciences 14, no. 4 (October 2000): 425–33. http://dx.doi.org/10.1017/s026996480014402x.

Full text

Abstract:

We consider a K-node queueing system sharing a setup server. Each node has a node server, a finite buffer, and a service position. Each job in the buffer at a node requires a setup by the setup server to receive service from the node server at the service position. The arrival process of jobs at each node is Poisson, the distribution of node service times at each node is general, and the setup times have a common exponential distribution. The setup server behaves like M setup servers (i.e., the server can simultaneously process up to M jobs). We consider two setup mechanisms by the setup server. One is that for a setup of job at each node, both the waiting position (occupied by the job) and service position are used. The other is that only the service position is used for a setup. The model operating under the former or latter is referred to as Model I or II, respectively. For each node in Model I or II, we construct a corresponding setup server queue (CSQ). We show that the stationary distribution of Model I or II is given by a product form of the stationary distributions of CSQs.

APA, Harvard, Vancouver, ISO, and other styles

21

Atar, Rami, Isaac Keslassy, Gal Mendelson, Ariel Orda, and Shay Vargaftik. "Persistent-Idle Load-Distribution." Stochastic Systems 10, no. 2 (June 2020): 152–69. http://dx.doi.org/10.1287/stsy.2019.0054.

Full text

Abstract:

A parallel server system is considered in which a dispatcher routes incoming jobs to a fixed number of heterogeneous servers, each with its own queue. Much effort has been previously made to design policies that use limited state information (e.g., the queue lengths in a small subset of the set of servers, or the identity of the idle servers). However, existing policies either do not achieve the stability region or perform poorly in terms of job completion time. We introduce Persistent-Idle (PI), a new, perhaps counterintuitive, load-distribution policy that is designed to work with limited state information. Roughly speaking, PI always routes to the server that has last been idle. Our main result is that this policy achieves the stability region. Because it operates quite differently from existing policies, our proof method differs from standard arguments in the literature. Specifically, large time properties of reflected random walk, along with a careful choice of a Lyapunov function, are combined to obtain a Lyapunov condition over sufficiently long-time intervals. We also provide simulation results that indicate that job completion times under PI are low for different choices of system parameters, compared with several state-of-the-art load-distribution schemes.

APA, Harvard, Vancouver, ISO, and other styles

22

Cai, Xiaoqiang, Xiaoqian Sun, and Xian Zhou. "STOCHASTIC SCHEDULING WITH PREEMPTIVE-REPEAT MACHINE BREAKDOWNS TO MINIMIZE THE EXPECTED WEIGHTED FLOW TIME." Probability in the Engineering and Informational Sciences 17, no. 4 (September 24, 2003): 467–85. http://dx.doi.org/10.1017/s0269964803174037.

Full text

Abstract:

We study a stochastic scheduling problem with a single machine subject to random breakdowns. We address the preemptive-repeat model; that is, if a breakdown occurs during the processing of a job, the work done on this job is completely lost and the job has to be processed from the beginning when the machine resumes its work. The objective is to complete all jobs so that the the expected weighted flow time is minimized. Limited results have been published in the literature on this problem, all with the assumption that the machine uptimes are exponentially distributed. This article generalizes the study to allow that (1) the uptimes and downtimes of the machine follow general probability distributions, (2) the breakdown patterns of the machine may be affected by the job being processed and are thus job dependent; (3) the processing times of the jobs are random variables following arbitrary distributions, and (4) after a breakdown, the processing time of a job may either remain a same but unknown amount, or be resampled according to its probability distribution. We derive the necessary and sufficient condition that ensures the problem with the flow-time criterion to be well posed under the preemptive-repeat breakdown model. We then develop an index policy that is optimal for the problem. Several important situations are further considered and their optimal solutions are obtained.

APA, Harvard, Vancouver, ISO, and other styles

23

Pinedo, Michael, Dequan Shaw, and Xiuli Chao. "On Optimal Permutation Scheduling in Stochastic Proportionate Flowshops." Probability in the Engineering and Informational Sciences 6, no. 4 (October 1992): 513–23. http://dx.doi.org/10.1017/s0269964800002709.

Full text

Abstract:

Consider m machines in series with unlimited intermediate buffers and n jobs available at time zero. The processing times of job j on all m machines are equal to a random variable Xj with distribution Fj. Various cost functions are analyzed using stochastic order relationships. First, we focus on minimizing where cj is the weight (holding cost) and Tj the completion time of job j. We establish that if are in a class of distributions we define as SIFR, and and are increasing sequences of likelihood ratio-ordered and stochastic-ordered random variables, respectively, the job sequence [1, 2, … n ] is optimal among all static permutation schedules. Second, for arbitrary processing time distributions, if is an increasing sequence of likelihood ratio-ordered (hazard rate-ordered) random variables and the costs are nonincreasing, then a general cost function is minimized by the job sequence [1,2,…, n] in the stochastic ordering (increasing convex ordering) sense.

APA, Harvard, Vancouver, ISO, and other styles

24

Ju, Young Su, Young Jun Kwon, Hee Tae Kang, and Yong Kyu Kim. "Occupational Distribution of Job Stress in Korea." Korean Journal of Occupational and Environmental Medicine 15, no. 4 (2003): 422. http://dx.doi.org/10.35371/kjoem.2003.15.4.422.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Montenegro, Alvaro. "Labor Mobility, Job Preferences, and Income Distribution." Labour 17, no. 1 (March 2003): 93–102. http://dx.doi.org/10.1111/1467-9914.00223.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Hahn, Joyce K., Henry R. Hyatt, Hubert P. Janicki, and Stephen R. Tibbets. "Job-to-Job Flows and Earnings Growth." American Economic Review 107, no. 5 (May 1, 2017): 358–63. http://dx.doi.org/10.1257/aer.p20171077.

Full text

Abstract:

The US workforce has had little change in real wages, income, or earnings since the year 2000. However, even when there is little change in the average rate at which workers are compensated, individual workers experienced a distribution of wage and earnings changes. In this paper, we demonstrate how earnings evolve in the US economy in the years 2001-2014 on a forthcoming dataset on earnings for stayers and transitioners from the U.S. Census Bureau's Job-to-Job Flows data product. We account for the roles of on-the-job earnings growth, job-to-job flows, and nonemployment in the growth of U.S. earnings.

APA, Harvard, Vancouver, ISO, and other styles

27

Sonenberg, Nikki, Grzegorz Kielanski, and Benny Van Houdt. "Performance Analysis of Work Stealing in Large-scale Multithreaded Computing." ACM Transactions on Modeling and Performance Evaluation of Computing Systems 6, no. 2 (June 30, 2021): 1–28. http://dx.doi.org/10.1145/3470887.

Full text

Abstract:

Randomized work stealing is used in distributed systems to increase performance and improve resource utilization. In this article, we consider randomized work stealing in a large system of homogeneous processors where parent jobs spawn child jobs that can feasibly be executed in parallel with the parent job. We analyse the performance of two work stealing strategies: one where only child jobs can be transferred across servers and the other where parent jobs are transferred. We define a mean-field model to derive the response time distribution in a large-scale system with Poisson arrivals and exponential parent and child job durations. We prove that the model has a unique fixed point that corresponds to the steady state of a structured Markov chain, allowing us to use matrix analytic methods to compute the unique fixed point. The accuracy of the mean-field model is validated using simulation. Using numerical examples, we illustrate the effect of different probe rates, load, and different child job size distributions on performance with respect to the two stealing strategies, individually, and compared to each other.

APA, Harvard, Vancouver, ISO, and other styles

28

Lin, Hong. "A Case Study of Teaching Parallel and Distributed Computing Topics on a Computer Cluster." Journal of Cases on Information Technology 16, no. 2 (April 2014): 58–71. http://dx.doi.org/10.4018/jcit.2014040105.

Full text

Abstract:

This paper presents the establishment of cluster computing lab at a minority serving institution that aims to provide computing resources to support undergraduate computer science curriculum. The computing resources of the cluster are managed by a job distribution environment that allows the users to upload, compile, and run their jobs. The job distribution software distributes the submitted jobs to the computing nodes of the cluster. The authors will present a case study of using this platform to teach parallel and distributed computing topics in the operating system course. The evaluation of the teaching effectiveness is presented thereafter.

APA, Harvard, Vancouver, ISO, and other styles

29

Salinas-Jiménez, Maria del Mar, Joaquín Artés, and Javier Salinas-Jiménez. "Educational mismatch and job aspirations." International Journal of Manpower 37, no. 1 (April 4, 2016): 115–34. http://dx.doi.org/10.1108/ijm-12-2014-0266.

Full text

Abstract:

Purpose – The purpose of this paper is to analyze the relationship between education, job aspirations and subjective well-being. This analysis is done across the entire well-being distribution and taking account of educational mismatches that could condition individuals’ satisfaction if education generates certain aspirations which are not met by the individuals. Design/methodology/approach – Using data from the European Social Survey, a quantile regression model is estimated. This approach allows one to assess the impact of the education variables at different points of the happiness conditional distribution. Findings – The results are consistent with the hypothesis that the impact of education on subjective well-being varies across the distribution, with education effects lower at the top of the happiness distribution. It is also found that education generates certain aspirations among individuals in regard to the job they expect to hold and that people suffer a psychological cost when those aspirations are not met. This “aspiration mechanism” seems however to weaken as one moves along the distribution. Originality/value – The central contribution of this paper lies in the treatment of job aspirations through different variables of educational mismatch. Although rising aspirations have often been highlighted as the main mechanism that could explain the weak relationship between education and subjective well-being, this mechanism has barely been analyzed empirically. Moreover, the effects of educational mismatch on individual satisfaction have only been analyzed at the mean of the conditional distribution. The value of this study is therefore twofold, focussing on the analysis across the entire well-being distribution of the aspiration mechanism generated by education in regard to the job an individual expects to hold.

APA, Harvard, Vancouver, ISO, and other styles

30

Al Abdullah, Hassan A., Mohamed A. Zytoon, and Nader H. Al Sayed. "Assessment of the Quality of Job Descriptions of Safety Jobs in the Saudi Companies." Journal of Safety Studies 4, no. 1 (January 15, 2018): 1. http://dx.doi.org/10.5296/jss.v4i1.12210.

Full text

Abstract:

The poor occupational safety and health (OSH) performance of many sectors in Saudi Arabia necessitates studying the reasons behind this performance. While other studies addressed many potential reasons, the objective of the current study is to investigate the quality of job descriptions of the safety jobs in Saudi Arabia. A sample of 69 job descriptions for several safety job titles and from different industrial or service sectors were analyzed to discover the important factors that may have an impact. The results revealed that there are some gaps in the design of the sampled job descriptions' components, particularly in the job information and the required qualifications for the jobs. The quality of job descriptions varied from one industrial sector to another, with oil & gas, petrochemicals and utilities sectors being in the top, and manufacturing, education/training, construction, and service/retail/distribution in the bottom in terms of job descriptions quality. There was no clear relationship between the safety job title and the quality of job descriptions. However, the required experience had positive impact on the quality of job descriptions of safety jobs. It is recommended that further studies covering a larger sample size of job descriptions to be conducted to obtain results that can be generalized and utilized in setting proper policies to improve the practices of the Saudi companies in the design of job descriptions of safety jobs and, hence, hiring the appropriate safety professionals.

APA, Harvard, Vancouver, ISO, and other styles

31

Gittleman, Maury B., and David R. Howell. "Changes in the Structure and Quality of Jobs in the United States: Effects by Race and Gender, 1973–1990." ILR Review 48, no. 3 (April 1995): 420–40. http://dx.doi.org/10.1177/001979399504800303.

Full text

Abstract:

Using 17 measures of job quality from the 1980 Census, the Current Population Survey, and the Dictionary of Occupational Titles, the authors perform a cluster analysis that groups 621 jobs covering 94% of the work force into six job categories (termed “contours”), a job classification closely resembling those suggested by labor market segmentation theory. The distribution of employment over the period 1973–90 shifted sharply away from the two middle-quality contours toward the two highest-quality contours. The two lowest-quality contours show no decline in employment share in the 1980s. The declining relative position of employed black and Hispanic men stems from both a worsening job mix relative to white men and a sharp drop in the quality of low-skill jobs. Female workers experienced both a greater shift away from jobs in the lower-quality contours and higher real earnings growth within each job contour than male workers.

APA, Harvard, Vancouver, ISO, and other styles

32

Prat, Julien. "Job Separation Under Uncertainty and the Wage Distribution." Contributions in Macroeconomics 6, no. 1 (January 22, 2006): 1–34. http://dx.doi.org/10.2202/1534-6005.1340.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Chéron, Arnaud, and Bénédicte Rouland. "Endogenous job destructions and the distribution of wages." Labour Economics 18, no. 6 (December 2011): 845–52. http://dx.doi.org/10.1016/j.labeco.2011.07.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Winter-Ebmer, Rudolf. "Unknown wage offer distribution and job search duration." Economics Letters 60, no. 2 (August 1998): 237–42. http://dx.doi.org/10.1016/s0165-1765(98)00096-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Gunn, A. "RAS job advertisement email distribution list going strong." Astronomy & Geophysics 43, no. 6 (December 1, 2002): 6.6—b—6.6. http://dx.doi.org/10.1093/astrog/43.6.6.6-b.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Burchell, Brendan J. "The Unequal Distribution of Job Insecurity, 1966-86." International Review of Applied Economics 13, no. 3 (September 1, 1999): 437–58. http://dx.doi.org/10.1080/026921799101625.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Christensen, Bent Jesper, Rasmus Lentz, Dale T. Mortensen, George R. Neumann, and Axel Werwatz. "On‐the‐Job Search and the Wage Distribution." Journal of Labor Economics 23, no. 1 (January 2005): 31–58. http://dx.doi.org/10.1086/425432.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Bertola, Giuseppe, and Leonardo Felli. "Job matching and the distribution of producer surplus." Ricerche Economiche 47, no. 1 (March 1993): 65–92. http://dx.doi.org/10.1016/0035-5054(93)90025-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Huber, P., H. Oberhofer, and M. Pfaffermayr. "Job creation and the intra-distribution dynamics of the firm size distribution." Industrial and Corporate Change 23, no. 1 (December 18, 2013): 171–97. http://dx.doi.org/10.1093/icc/dtt055.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Kline, Patrick, and Christopher Walters. "Reasonable Doubt: Experimental Detection of Job‐Level Employment Discrimination." Econometrica 89, no. 2 (2021): 765–92. http://dx.doi.org/10.3982/ecta17489.

Full text

Abstract:

This paper develops methods for detecting discrimination by individual employers using correspondence experiments that send fictitious resumes to real job openings. We establish identification of higher moments of the distribution of job‐level callback rates as a function of the number of resumes sent to each job and propose shape‐constrained estimators of these moments. Applying our methods to three experimental data sets, we find striking job‐level heterogeneity in the extent to which callback probabilities differ by race or sex. Estimates of higher moments reveal that while most jobs barely discriminate, a few discriminate heavily. These moment estimates are then used to bound the share of jobs that discriminate and the posterior probability that each individual job is engaged in discrimination. In a recent experiment manipulating racially distinctive names, we find that at least 85% of jobs that contact both of two white applications and neither of two black applications are engaged in discrimination. To assess the potential value of our methods for regulators, we consider the accuracy of decision rules for investigating suspicious callback behavior in various experimental designs under a simple two‐type model that rationalizes the experimental data. Though we estimate that only 17% of employers discriminate on the basis of race, we find that an experiment sending 10 applications to each job would enable detection of 7–10% of discriminatory jobs while yielding Type I error rates below 0.2%. A minimax decision rule acknowledging partial identification of the distribution of callback rates yields only slightly fewer investigations than a Bayes decision rule based on the two‐type model. These findings suggest illegal labor market discrimination can be reliably monitored with relatively small modifications to existing correspondence designs.

APA, Harvard, Vancouver, ISO, and other styles

41

Bao, Danwen, Tangyi Guo, and Hongshan Xia. "Impacts of spatial mismatch on commuting time of urban residents in China." PROMET - Traffic&Transportation 26, no. 3 (June 13, 2014): 227–33. http://dx.doi.org/10.7307/ptt.v26i3.1385.

Full text

Abstract:

In much of studies on spatial mismatch between residential and employer locations, job accessibility has been measured. However, the apparent disadvantages of the traditional measurement methods on the studies of Chinese cities have been noted. This paper proposed an optimized method for job accessibility measurement by introducing the weigh coefficient of job opportunity, which quantifies the degree of uneven distribution of job opportunity in the Chinese cities. Take Nanjing city for example, this new method was used to measure the spatial distribution of job opportunity, investigate the spatial patterns and analyze the influences of job accessibility on commuting behavior. The results show that the distribution of job accessibility in Nanjing exhibits the different spatial patterns and mechanisms compared with US cases.

APA, Harvard, Vancouver, ISO, and other styles

42

Febriansyah, Febriansyah, and Nani Nurani Muksin. "Hoax Distribution in Social Media After Ratification of Omnibus Law." Jurnal ASPIKOM 6, no. 2 (July 25, 2021): 315. http://dx.doi.org/10.24329/aspikom.v6i2.871.

Full text

Abstract:

Social media had both positive and negative impacts. Lately, hoaxes had spread on social media massively after the ratification of the Job Creation Law (Omnibus Law). This research aimed to obtain an overview of hoax distribution on social media that emerged after the ratification of the Job Creation Law, find out the factors that cause it, and solve hoaxes on social media. The research method used was a descriptive qualitative approach. The results showed that hoax contents were circulating on social media after the ratification of the Job Creation Law. This was due to the lack of awareness of the digital media literacy culture and the absence of clarity regarding the draft of the Job Creation bill that was passed. The solution to eradicating hoaxes on social media could be done with three approaches: culture (literacy), technology, and law.

APA, Harvard, Vancouver, ISO, and other styles

43

Wang, Cui Yan, Wei Sheng Du, and Jun Wang. "Optimization Algorithm Study for Multiple-Constrained and Multiple-Objective Job-Shop Tool Dynamic Distribution." Applied Mechanics and Materials 551 (May 2014): 612–16. http://dx.doi.org/10.4028/www.scientific.net/amm.551.612.

Full text

Abstract:

It’s an NP problem for distributing tools for job-shop tasks when the schedules were formulated, and it belongs to multiple-constrained and multiple-objective problem. Based on adaptive weight approach, the restriction and multiple objective problems were solved. The optimization dynamic distribution model for this problem was established. Then heuristic and self-adaptive genetic algorithm was presented. In order to express the dynamic of the distribution result, Two-dimensional coding technology was adopted, a new coding rule combining dispatching rule was designed. The results show that hybrid self-adaptive genetic algorithm based on adaptive weight approach forms well for multiple-constrained and multiple-objective job-shop tool dynamic distribution.

APA, Harvard, Vancouver, ISO, and other styles

44

Zhou, Yang. "Understanding job mobility patterns in contemporary China: A comparative study based on the China Family Panel Studies and the Panel Study of Income Dynamics." Chinese Journal of Sociology 5, no. 4 (September 30, 2019): 453–73. http://dx.doi.org/10.1177/2057150x19871909.

Full text

Abstract:

Based on a comparison between labor markets in China and those in the USA and using data from the China Family Panel Studies and the Panel Study of Income Dynamics, this paper studies the level, distribution and socioeconomic patterns of job mobility in contemporary China. I first discuss the different social contexts in China and the USA that have generated distinct opportunity structures of job mobility. Differences in levels of economic development, cultural traditions and institutional arrangements help to shape different labor markets and job mobility patterns across the two societies. I argue that job mobility is not always as good as we thought. There is a duality of job mobility at both the individual and the societal levels. Second, I develop several indexes and use the percentile share method to analyze job mobility rates by different groups and their uneven distributions. Compared to the USA, I find that China has a lower overall level of job mobility, a more skewed distribution and a higher concentration of mobility in socioeconomically disadvantaged groups, such as the elderly, the less-educated and those of rural origin. The results demonstrate the importance of understanding the duality of mobility; that is, that mobility can be either upward or downward. In contemporary China, socioeconomically disadvantaged people may suffer downward job mobility.

APA, Harvard, Vancouver, ISO, and other styles

45

Cleveland, Jeanette N., and Frank J. Landy. "Age Perceptions of Jobs: Convergence of Two Questionnaires." Psychological Reports 60, no. 3_part_2 (June 1987): 1075–81. http://dx.doi.org/10.1177/0033294187060003-211.1.

Full text

Abstract:

Purpose of this study is to provide empirical information on the age perceptions of 40 managerial jobs. 120 managers were asked to complete either a frequency grid questionnaire or a numerically anchored rating scale describing their perceptions of the age distribution in each job. Jobs were classified as older, younger, or age-neutral only if results obtained using the two questionnaires provided converging classifications. Of these jobs 62% were classified as older, younger, or age-neutral using the convergence criteria. The consideration of contextual variables such as job characteristics is discussed in relation to decision outcomes.

APA, Harvard, Vancouver, ISO, and other styles

46

Heisz, Andrew. "Changes in Job Duration in Canada." Articles 54, no. 2 (April 12, 2005): 365–87. http://dx.doi.org/10.7202/051238ar.

Full text

Abstract:

Using monthly data from the Canadian Labour Force Survey, the author investigates changes in the complete duration of new job spells from 1981 through 1996. While the average complete length of new jobs did not increase or decrease over the period, investigation of the distribution of complete job lengths reveals two important changes. First, the probability that a new job would end within 6 months rose during the 1980s, but then reversed during the 1990s, meaning that there was important change over the period as a whole. Second, the conditional probability that a job that had lasted 6 months would continue on past 5 years rose through the whole period. This pattern of change was found among virtually all demographic subgroups examined, suggesting that an economy-wide (rather than a sectoral or demographic) explanation must be sought.

APA, Harvard, Vancouver, ISO, and other styles

47

Cai, Liu, Luo, Xing, and Liu. "Job Accessibility from a Multiple Commuting Circles Perspective Using Baidu Location Data: A Case Study of Wuhan, China." Sustainability 11, no. 23 (November 26, 2019): 6696. http://dx.doi.org/10.3390/su11236696.

Full text

Abstract:

Jobs–housing imbalance is a hot topic in urban study and has obtained many results. However, little research has overcome the limits of administrative boundaries in job accessibility measurement and considered differences in job accessibility within multiple commuting circles. Using Baidu location data, this research proposes a new method to measure job accessibility within multiple commuting circles at the grids’ level. Taking the Wuhan metropolitan area as a case study, the results are as follows: (1) Housing and service jobs are concentrated in the central urban areas along the Yangtze River, whereas industrial jobs are scattered throughout suburbs with double centers. The potential competition for job opportunities is fiercer in the city center than in the suburbs. (2) Job accessibility with different levels shows significant circle-like distribution. People with long- or short-distance potential commutes demand to live close to the groups with the same demand. Residents with long-distance commutes demand to live outside of where those with short-distance commutes demand to reside, regardless of whether their commuting demand is for service or industrial jobs. (3) There are three optimization patterns for transit services to increase job accessibility in various areas. These patterns involve areas with inadequate job opportunities, poor transit services to service jobs, and poor transit services to industrial jobs. Developing current transit facilities or new transit alternatives as well as adding extra jobs near housing could improve jobs–housing imbalance in these areas. Findings from this study could guide the allocation of jobs and housing as well as the development of transport to reduce residents’ commuting burdens and promote transportation equity. The method used in this study can be applied to evaluate jobs–housing imbalance from the perspective of the supply in other metropolises.

APA, Harvard, Vancouver, ISO, and other styles

48

-, Sigit Fadhil Rais, Mirwan Surya Perdhana, and Zainur Hidayah. "Influence Analysis Of Forced Distribution Rating Performance Appraisal And Merit Pay To Performance Of Directorate General Of Taxes’s Employees With Job Satisfaction As Intervening Variable At Blora Tax Service Office." IJHCM (International Journal of Human Capital Management) 5, no. 1 (May 31, 2021): 91–106. http://dx.doi.org/10.21009/ijhcm.05.01.8.

Full text

Abstract:

This study aims to analyze and determine influence of forced distribution rating performance appraisal and merit pay toward performance of Directorate General of Taxes’s employees with job satisfaction as intervening variable at Blora Tax Service Office. Technique used for this study is census then data analyzed with SmartPLS. This research’s subjects are 80 low management employees at Blora Tax Service Office. The result of this research shows that forced distribution rating performance appraisal and merit pay don’t affect directly on employee’s performance. But forced distribution rating performance appraisal and merit pay have positive and significant effect on job satisfaction while job satisfaction has positive and significant effect on performance. Then indirectly through job satisfaction, forced distribution rating performance appraisal and merit pay have positive and significant effect to employee’s performance. This result shows that job satisfaction is a suitable intervening variable for this research. Based on this research, it is suggested for future managerial policy with goal to increase performance, job satisfaction should be one of deciding factors.

APA, Harvard, Vancouver, ISO, and other styles

49

Borst, Sem, John Bruno, E. G. Coffman, and Steven Phillips. "Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines." Probability in the Engineering and Informational Sciences 11, no. 1 (January 1997): 95–105. http://dx.doi.org/10.1017/s0269964800004708.

Full text

Abstract:

Simple optimal policies are known for the problem of scheduling jobs to minimize expected makespan on two parallel machines when the job running-time distribution has a monotone hazard rate. But no such policy appears to be known in general. We investigate the general problem by adopting two-point running-time distributions, the simplest discrete distributions not having monotone hazard rates. We derive a policy that gives an explicit, compact solution to this problem and prove its optimality. We also comment briefly on first-order extensions of the model, but each of these seems to be markedly more difficult to analyze.

APA, Harvard, Vancouver, ISO, and other styles

50

BATAINEH, SAMEER. "DIVISIBLE LOAD DISTRIBUTION IN A NETWORK OF PROCESSORS." Journal of Interconnection Networks 09, no. 01n02 (March 2008): 31–51. http://dx.doi.org/10.1142/s021926590800214x.

Full text

Abstract:

The paper presents a closed form solution for an optimum scheduling of a divisible job on an optimum number of processor arranged in an optimum sequence in a multilevel tree networks. The solution has been derived for a single divisible job where there is no dependency among subtasks and the root processor can either perform communication and computation at the same time. The solution is carried out through three basic theorems. One of the theorems selects the optimum number of available processors that must participate in executing a divisible job. The other solves the sequencing problem in load distribution by which we are able to find the optimum sequence for load distribution in a generalized form. Having the optimum number of processors and their sequencing for load distribution, we have developed a closed form solution that determines the optimum share of each processor in the sequence such that the finish time is minimized. Any alteration of the number of processors, their sequences, or their shares that are determined by the three theorems will increase the finish time.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Job distribution'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles