Earliness Of Jobs Research Articles

Do School Achievements Affect the Early Jobs of High School Graduates in the United States and Japan?

Although American employers call for schools to improve students' achievement, surveys of employers suggest that they do not use students' grades in their hiring decisions. Japanese employers use grades in their hiring, but are ambivalent about this procedure and vague about how thoroughly they act on it. This study examines the influence of grades, noncognitive behaviors, and fathers' occupations on the early occupational attainments of high school graduates in the United States and Japan. Analyses of High School and Beyond longitudinal surveys in both countries find that high school grades have large effects on early jobs in Japan, but little effect in the Unites States, especially for males. Moreover, contrary to contentions by Bowles and Gintis, noncognitive behaviors have few influences on jobs in either country. The authors speculate about the implications of this system for youths' incentives, counselors' advice, and youths' experience in the transition from high school to work.

Minimum number of tardy jobs in single machine scheduling with release dates—an improved algorithm

Scheduling of n-jobs on a single machine is studied here where each job i has a specified ready time, processing time and due date. It is assumed that early jobs have early due dates. An algorithm that minimizes the number of tardy jobs for this problem has been presented in Kise et al. [1]. We adopt the “blocks” concept to modify their algorithm to eliminate unnecessary computations. The improved algorithm developed here also employs a backward searching process for tardy jobs and uses a stopping rule for this search to further reduce the computational requirements.

Scheduling n jobs on one machine to minimize the maximum tardiness with minimum number

The “one machine” scheduling problem is considered with the dual objective of minimizing the maximum tardiness with minimum number of tardy jobs. A simple procedure is introduced to obtain an optimal schedule with minimum “maximum tardiness” when the set of nontardy jobs is specified. A branch and bound algorithm is presented to obtain the optimal schedule that minimizes the maximum tardiness with minimum number of tardy jobs. A condition is also given to identify an initial set of early jobs. Several theorems are formulated and proved in order to justify the elimination of much branching.

確率制約を伴う機械スケジューリング問題の解法

We consider an n-job one machine scheduling problem in which the processing time of each job i is a random variable subject to a normal distribution N(mi' v() and the object is to maximize the weighted number of early jobs subject to the constraint that some specified jobs must be early. It is assumed that mp < mq implies v~ ~ vJ, where mi and vl are, respectively, a known mean value and a known variance associated with each job i. If such constraint is relaxed, the problem has been shown to be NP-complete, suggesting strongly that there exists no efficient exact algorithm whatever for the problem. Moreover, it is assumed that if mp < mq or v~ < vJ, then wp ~ W q' where wi is a known weight associated with each job i. It is well known for the problem with arbitrary weights to be NP-complete even in the deterministic case (Le., vl = 0). We show that the problem with the above assumptions can be solved in O(n2) time and that it has a practical application. ' ~ ~ a nownmean