Relevant bibliographies by topics / Job distribution

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Job distribution'

Author: Grafiati
Published: 4 June 2021
Last updated: 18 February 2022

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Job distribution.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "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
More sources

Dissertations / Theses on the topic "Job distribution"

1

Unge, Simon. "Implementing a Eventual Consistency Job Distribution with CouchDB." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-156439.

Full text
Abstract:
The implementation of a job distributer in a distributed system can be a complex task. There is no shared memory or a reliable global clock, and network failures can, and will, occur, making communication between the different nodes of the system complex. To make life easier for the programmer, I have evaluated if CouchDB can be used as tool for reliable communication and synchronization between nodes. The results shows that CouchDB indeed can be used for this purpose. CouchDB takes care of the communication, and guarantees that the nodes will, eventually, get the jobs to execute. With CouchDB as the backbone in a job distributer, the programmer can concentrate of the functionality of the job distributer, and not worry about the need to implement a reliable communication between nodes with all the complexity that comes with it.
APA, Harvard, Vancouver, ISO, and other styles
2

Natarajan, Subramanian. "Dynamic optimization of job distribution on machine tools using time decomposition into constant job-mix stages." Thesis, McGill University, 1992. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=60709.

Full text
Abstract:
This thesis deals with the development, analysis and application of a new method to optimize the allocation of jobs on machine tools. The benefits of this method are derived through time-decomposition of the scheduling horizon.
The decomposition scheme is based on the scheduled flow of jobs i.e., the input of jobs to the shop floor and their departure after processing. The partitioning procedure divides the planning horizon into 'stages', or time periods, at which the job-mix remains constant. The optimization of job allocation is carried out within each partition and successive stages are treated sequentially. The dynamic nature of the problem is such that the solution at a stage affects the boundary conditions of the subsequent stage. The Constant Job-Mix Stage (CMS) algorithm developed to solve the job allocation problem, accounts of the setup times and enables one to obtain integer solutions while reducing slack on machines and enforcing due date on jobs.
The application of the algorithm is demonstrated for three different cases. The first two cases focus on single operation jobs and represent two different approaches to scheduling. The third case deals with the assignment of multiple operation jobs to machine tools which are grouped according to processes.
APA, Harvard, Vancouver, ISO, and other styles
3

Martin, Christopher L. "Distribution and procedural justice : effects on satisfaction and commitment." Diss., Georgia Institute of Technology, 1987. http://hdl.handle.net/1853/29169.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Schröder, Klaus. "Balls-into-bins a paradigm for job allocation, data distribution processes, and routing /." [S.l. : s.n.], 2000. http://deposit.ddb.de/cgi-bin/dokserv?idn=963147307.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

He, Yongjuan. "Optimum population distribution described by dynamic models and controlled by immigration and job creation." Thesis, University of Ottawa (Canada), 2004. http://hdl.handle.net/10393/26652.

Full text
Abstract:
In this thesis, dynamic mathematical models are constructed to describe the population distribution in Canada based on the model in previous work by Ahmed and Rahim [1]. Numerical results demonstrate that the model population is in close agreement with the actual population. This indicates that the presented model can be used as a valuable tool for describing the dynamics of population distribution. We also demonstrate that by using modern Systems and Optimal Control theory [2], it is possible to formulate optimum immigration and job creation strategies while maintaining population level close to certain pre-specified targets. An optimization algorithm [2] is then developed based on dynamic programming and gradient algorithm approach. Unknown parameters such as birth rate, death rates and transition rates are estimated and identified. The system model obtained by using the identified parameters is then augmented by adding a fourth equation describing the dynamics of unemployment rate. This model is then used to formulate a control problem with immigration and job creation rates being the decision (control) variables. Using optimal control theory, optimum immigration and job creation policies are determined. Results are illustrated by numerical simulation and they are found to be very encouraging.
APA, Harvard, Vancouver, ISO, and other styles
6

Shuter, Melanie. "The operational implications of service customisation level." Queensland University of Technology, 2005. http://eprints.qut.edu.au/16137/.

Full text
Abstract:
THE OPERATIONAL IMPLICATIONS OF SERVICE CUSTOMISATION LEVEL Customisation offers the opportunity for organisations to capitalise on the many potential benefits to both themselves and to clients, afforded by offering a greater choice of goods and services for customers. Many organisations have implemented increased customisation with the expectation of increased demand and profitability. However a critical analysis of the operational aspects involved in customising services reveals that different levels of customisation have distinct operational needs which render the adoption of different levels of customisation more difficult than is indicated in existing literature. Three distinct degrees of customisation are examined in this study. These are standardisation, medium customisation and high customisation. The study puts forward a comprehensive model which provides an insight into the organisational factors which potentially enable or impede an organisation in introducing different levels of customisation. This model builds on previous studies of factors which impact on the ability of an organisation to deliver customised services. Factors which are included in this model are: (a) the level and type of knowledge, skills and abilities (KSA's) held by employees involved in designing and delivering services (b) the degree of information distribution and exchange between employees and (c) goal clarity for staff involved in delivering the service. Initial case studies conducted in six organisations and a subsequent quantitative study which elicited 101 responses from 21 organisations, revealed that each level of customisation held a distinct configuration of these operational factors. Organisations offering high customisation were characterised by a low degree of information distribution and exchange between employees, a high level of KSA's about the service being provided and low goal clarity for service staff. Organisations offering medium customisation were characterised by a high degree of information distribution and exchange between employees, a moderate level of KSA's about the service being provided and relatively high goal clarity for staff. Organisations offering standardised services were characterised by a low degree of information distribution and exchange between employees, a low level of KSA's required about the service being provided and high goal clarity for staff. By examining the relationship between customisation and the identified operational implications, the study allows us to piece together a multi-faceted viewpoint of the same broad issue, which is answered by the overarching question 'how are organisations enabled to provide different levels of customisation'? This study therefore provides us with a well-rounded insight as to how and why organisations can effectively implement different levels of service customisation.
APA, Harvard, Vancouver, ISO, and other styles
7

Colatat, Mahyulee C. "Estimating Performance Mean and Variability With Distributional Rating Scales: A Field Study Towards Improved Performance Measurement." Bowling Green State University / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1206385486.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Carlisle, B. T. J. "An evaluation of the effect of lack of availability and poor distribution of information on successful job and organisation design in workers' co-operatives." Thesis, University of Stirling, 1988. http://hdl.handle.net/1893/6506.

Full text
Abstract:
This Thesis documents an exploratory investigation into the effect of poor information management on successful job and organisation design in workers' co-operatives. It was hypothesised that lack of availability and poor distribution of information militate against successful job and organisation design. Since sound information management is imperative for decision making and successful job and organisation design ensures workers satisfaction this study is fully justified. It is important that workers' co-operatives are economically successful and that people enjoy working in them. The topic is particularly important for the workers' co-operative movement because little research has been conducted on the links between information management and job and organisation design. The Thesis summarises the main issues and concepts relevant to the research topic and describes the implications of information management for job and organisation design in workers' co-operatives. The purchasing processes in four workers' co-operatives in Scotland were chosen as the information systems to be studied. Research field work, in the form of a Job Diagnosis Survey was also carried out to establish the links between information management and job and organisation design. Research results have been examined in relation to the participative arrangements one associates with workers' co-operatives. It was found that in addition to information management, other issues have an effect on successful job and organisation design. These include: objectives of each business; Argyris's Theory in Action; Lack of management skills; and poor systems design. This led to a comparison of the four co-operatives studied with the very successful Mondragon Group. Finally the implications of the research results have been discussed in relation to the workers' co-operative movement and to future research by those interested or involved in the movement.
APA, Harvard, Vancouver, ISO, and other styles
9

Ahmetspahic, Emir. "Distributed Computing in Peer-to-peer Networks." Thesis, Linköping University, Department of Computer and Information Science, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2575.

Full text
Abstract:

Concepts like peer-to-peer networks and distributed computing are not new. They have been available in different forms for a long time. This thesis examines the possibility of merging these concepts. The assumption is that non-centralized peer-to-peer networks can be used for effective sharing of computing resources. While most peer-to-peer systems today concentrate on sharing of data in various forms, this thesis concentrates on sharing of clock cycles instead of files.

APA, Harvard, Vancouver, ISO, and other styles
10

Trichy, Ravi Vignesh. "Runtime Systems and Scheduling Support for High-End CPU-GPU Architectures." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1338324367.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Job distribution"

1

Hamermesh, Daniel S. The changing distribution of job satisfaction. Cambridge, MA: National Bureau of Economic Research, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Galen, Guengerich, ed. Sales and distribution. New York: F. Watts, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Burchell, Brendan. The unequal distribution of job insecurity, 1966-1986. Cambridge: ESRC Centre for Business Research, University of Cambridge, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Felli, Leonardo. Job matching, learning and the distribution of surplus. London: Suntory-Toyota International Centre for Economics and Related Disciplines, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wunder, Christoph. Income inequality and job satisfaction of full-time employees in Germany. Bonn, Germany: IZA, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ted, Wannell, and Statistics Canada. Business and Labour Market Analysis Group., eds. Trends in the distribution of employment by employer size: Recent Canadian evidence. [Ottawa]: Business and Labour Market Analysis Group, Analytical Studies Branch, Statististics Canada, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Oliveira, Victor J. Distribution of employment growth in 10 Ozark counties: A case study. Washington, D.C: U.S. Dept. of Agriculture, Economic Research Service, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Schaub, James D. Distribution of employment growth in 10 Georgia counties: A case study. Washington, D.C: U.S. Dept. of Agriculture, Economic Research Service, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Work, Canada Advisory Group on Working Time and the Distribution of. Report of the Advisory Group on Working Time and the Distribution of Work. [Ottawa]: Advisory Group on Working Time and the Distribution of Work, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Thāwarō, Thawī. Kānsāng ngān læ kānkračhāi rāidāi khō̜ng mō̜lam =: Job building and income distribution of molum. [Maha Sarakham]: Sathāban Wičhai Sinlapa læ Watthanatham ʻĪsān, Mahāwitthayālai Mahā Sārakhām, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Job distribution"

1

Lee, HyoYoung, DongWoo Lee, and R. S. Ramakrishna. "An Enhanced Grid Scheduling with Job Priority and Equitable Interval Job Distribution." In Advances in Grid and Pervasive Computing, 53–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11745693_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lozano, J. A., and A. Mendiburu. "Estimation of Distribution Algorithms Applied to the Job Shop Scheduling Problem: Some Preliminary Research." In Estimation of Distribution Algorithms, 231–42. Boston, MA: Springer US, 2002. http://dx.doi.org/10.1007/978-1-4615-1539-5_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hao, Xinchang, Lu Sun, and Mitsuo Gen. "Multi-objective Job Shop Rescheduling with Estimation of Distribution Algorithm." In Proceedings of the Eleventh International Conference on Management Science and Engineering Management, 35–46. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-59280-0_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Berten, Vandy, and Joël Goossens. "On the Job Distribution in Random Brokering for Computational Grids." In Parallel and Distributed Processing and Applications, 367–71. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30566-8_44.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bonn, Matthias, and Hartmut Schmeck. "The JoSchKa System: Organic Job Distribution in Heterogeneous and Unreliable Environments." In Architecture of Computing Systems - ARCS 2010, 73–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11950-7_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

He, Xiao-juan, Jian-chao Zeng, Song-dong Xue, and Li-fang Wang. "An Efficient Estimation of Distribution Algorithm for Job Shop Scheduling Problem." In Swarm, Evolutionary, and Memetic Computing, 656–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-17563-3_77.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Jarboui, Bassem, Mansour Eddaly, Patrick Siarry, and Abdelwaheb Rebaï. "An Estimation of Distribution Algorithm for Minimizing the Makespan in Blocking Flowshop Scheduling Problems." In Computational Intelligence in Flow Shop and Job Shop Scheduling, 151–67. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02836-6_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Wang, Shengyao, Ling Wang, Gang Zhou, and Ye Xu. "An Estimation of Distribution Algorithm for the Flexible Job-Shop Scheduling Problem." In Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, 9–16. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-25944-9_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lee, Seungha, Yangwoo Kim, and Woongsup Kim. "A Peer-to-Peer Based Job Distribution Model Using Dynamic Network Structure Transformation." In Lecture Notes in Electrical Engineering, 377–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-40675-1_58.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

He, Xiaojuan, Jianchao Zeng, Songdong Xue, and Lifang Wang. "An New Estimation of Distribution Algorithm Based Edge Histogram Model for Flexible Job-Shop Problem." In Computer Science for Environmental Engineering and EcoInformatics, 315–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22694-6_44.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Job distribution"

1

Lupin, Sergey, Sai Win Maw, Aye Min Thike, Dmitry Kovalenko, and John Worden. "Job distribution in hierarchic systems." In 2015 Internet Technologies and Applications (ITA). IEEE, 2015. http://dx.doi.org/10.1109/itecha.2015.7317378.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Toporkov, Victor, Anna Toporkova, Alexey Tselishchev, Dmitry Yemelyanov, and Petr Potekhin. "Job Flow Distribution and Ranked Jobs Scheduling in Grid Virtual Organizations." In 2015 44th International Conference on Parallel Processing Workshops (ICPPW). IEEE, 2015. http://dx.doi.org/10.1109/icppw.2015.36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Li, Jun, and Yong Jiang. "Estimation of Distribution Algorithms for Job Schedule Problem." In 2009 Second International Conference on Information and Computing Science. IEEE, 2009. http://dx.doi.org/10.1109/icic.2009.9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kang Jianqiang, Zhaochenxu, and Kanghaiping. "Research and application of 3G electrical safety job site intelligent monitoring device." In 2014 China International Conference on Electricity Distribution (CICED). IEEE, 2014. http://dx.doi.org/10.1109/ciced.2014.6991810.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Abarghooi, Hojat Moshtaghian, Azim Nobakht, and Ali Anvari. "Ethical climate, job satisfaction, organizational commitment and intention to leave in personnel of shiraz electric power distribution company." In 18th Electric Power Distribution Network Conference. IEEE, 2013. http://dx.doi.org/10.1109/epdc.2013.6565965.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Xiong, Chaolin, Zhixin Yang, Hualiang Li, Kai Zhang, Yu Wang, and Yali Shen. "Job Satisfaction Recognition of Power Distribution Staff Based on Voice Analysis." In 2020 IEEE International Conference on Information Technology,Big Data and Artificial Intelligence (ICIBA). IEEE, 2020. http://dx.doi.org/10.1109/iciba50161.2020.9277105.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Carvalho, Luiz Carlos Felix, and Marcia Aparecida Fernandes. "A Simple Estimation of Distribution Algorithm for the Flexible Job-Shop Problem." In 2017 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2017. http://dx.doi.org/10.1109/cec.2017.7969575.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Moon, Yong-Hyuk, Jae-Hoon Nah, Jong-Soo Jang, and Chan-Hyun Youn. "An Optimized Time-constraint Job Distribution Scheme in Group based P2P Networks." In 5th ACIS International Conference on Software Engineering Research, Management & Applications (SERA 2007). IEEE, 2007. http://dx.doi.org/10.1109/sera.2007.53.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Chen, Ing-Yi, and Guo-Kai Ni. "A QoS-Aware Job Rescheduling Mechanism for Service-Oriented Media Distribution Systems." In 2011 15th IEEE International Enterprise Distributed Object Computing Conference Workshops (EDOCW). IEEE, 2011. http://dx.doi.org/10.1109/edocw.2011.42.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Boodaghians, Shant, Federico Fusco, Stefano Leonardi, Yishay Mansour, and Ruta Mehta. "Online Revenue Maximization for Server Pricing." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/568.

Full text
Abstract:
Efficient and truthful mechanisms to price time on remote servers/machines have been the subject of much work in recent years due to the importance of the cloud market. This paper considers online revenue maximization for a unit capacity server, when jobs are non preemptive, in the Bayesian setting: at each time step, one job arrives, with parameters drawn from an underlying distribution. We design an efficiently computable truthful posted price mechanism, which maximizes revenue in expectation and in retrospect, up to additive error. The prices are posted prior to learning the agent's type, and the computed pricing scheme is deterministic. We also show the pricing mechanism is robust to learning the job distribution from samples, where polynomially many samples suffice to obtain near optimal prices.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Job distribution"

1

Hamermesh, Daniel. The Changing Distribution of Job Satisfaction. Cambridge, MA: National Bureau of Economic Research, September 1999. http://dx.doi.org/10.3386/w7332.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bartik, Timothy J. The Effects of Metropolitan Job Growth on the Size Distribution of Family Income. W.E. Upjohn Institute, March 1991. http://dx.doi.org/10.17848/wp91-06.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Autor, David, Susan Houseman, and Sari Pekkala Kerr. The Effect of Work First Job Placements on the Distribution of Earnings: An Instrumental Variable Quantile Regression Approach. Cambridge, MA: National Bureau of Economic Research, April 2012. http://dx.doi.org/10.3386/w17972.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Coşar, A. Kerem, Nezih Guner, and James Tybout. Firm Dynamics, Job Turnover, and Wage Distributions in an Open Economy. Cambridge, MA: National Bureau of Economic Research, September 2010. http://dx.doi.org/10.3386/w16326.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ajzenman, Nicolás, Gregory Elacqua, Luana Marotta, and Anne Sofie Olsen. Order Effects and Employment Decisions: Experimental Evidence from a Nationwide Program. Inter-American Development Bank, August 2021. http://dx.doi.org/10.18235/0003558.

Full text
Abstract:
In this paper, we show that order effects operate in the context of high-stakes, real-world decisions: employment choices. We experimentally evaluate a nationwide program in Ecuador that changed the order of teaching vacancies on a job application platform in order to reduce teacher sorting (that is, lower-income students are more likely to attend schools with less qualified teachers). In the treatment arm, the platform showed hard-to-staff schools (institutions typically located in more vulnerable areas that normally have greater difficulty attracting teachers) first, while in the control group teaching vacancies were displayed in alphabetical order. In both arms, hard-to-staff schools were labeled with an icon and identical information was given to teachers. We find that a teacher in the treatment arm was more likely to apply to hard-to-staff schools, to rank them as their highest priority, and to be assigned to a job vacancy in one of these schools. The effects were not driven by inattentive, altruistic, or less-qualified teachers. The program has thus helped to reduce the unequal distribution of qualified teachers across schools of different socioeconomic backgrounds.
APA, Harvard, Vancouver, ISO, and other styles
6

Davis, Steven. The Quality Distribution of Jobs and the Structure of Wages in Search Equilibrium. Cambridge, MA: National Bureau of Economic Research, August 2001. http://dx.doi.org/10.3386/w8434.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Toney, Autumn, and Melissa Flagg. U.S. Demand for AI-Related Talent. Center for Security and Emerging Technology, August 2020. http://dx.doi.org/10.51593/20200027.

Full text
Abstract:
The U.S. government and industry both see artificial intelligence as a pivotal technology for future growth and competitiveness. What skills will be needed to create, integrate, and deploy AI applications? This data brief analyzes market demand for AI-related jobs to determine their educational requirements, dominant sectors, and geographic distribution.
APA, Harvard, Vancouver, ISO, and other styles
8

Aberman, Noora-Lisa, Doreen S. Kufoalor, and Rachel Gilbert. Mapping the implementation process for subsidized fertilizer distribution under Ghana’s Planting for Food and Jobs Program. Washington, DC: International Food Policy Research Institute, 2021. http://dx.doi.org/10.2499/p15738coll2.134432.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Job distribution' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography