• International Journal of Contents
• /
• v.6 no.2
• /
• pp.10-13
• /
• 2010

For applications that are grid enabled, the grid can offer a resource balancing effect by scheduling grid jobs on machines with low utilization. When jobs communicate with each other, the internet, or with storage resources, an advanced scheduler could schedule them to minimize communications traffic or minimize the distance of the communications. We propose an intelligent load distribution algorithm to minimize communications traffic and distance of the communications using genetic algorithm. The experiments show the proposed load redistribution algorithm performs efficiently in the variance of load in grid environments.

• Journal of the military operations research society of Korea
• /
• v.9 no.1
• /
• pp.51-61
• /
• 1983

Lagrangian relaxation is used to the problem of scheduling jobs on unrelated parallel processors with the objective of minimizing makespan. The implicit condition for optimality is drawn out explicitly in order to apply the subgradient algorithm. To obtain the optimal solution, branch-and-bound-search method is devised. In the search, the special structure of the problem is exploited effectively, Some computational experiences with the algorithm are presented, and comparisons are made with the Land and Doig method.

• Journal of the Korean Professional Engineers Association
• /
• v.15 no.2
• /
• pp.52-59
• /
• 1982

This is to intent of the reinforcement proposal for current P.E., qualification code in necessity of improving the foreign technology inducement & technology export between advanced Country and developing or undeveloping Country as Technological Cooperation for mutual benefit. A prosal contains internationally recogniyed general term & conditions of Standard Contract form for Engineering jobs, construction works includings of plant exportation as for additional new basic knowledge for roling of business promotion & finalization in urging of more current jobs internationally to be increment of technological cooperation.

• Korean Management Science Review
• /
• v.12 no.3
• /
• pp.177-185
• /
• 1995

This paper presents a Tabu Search method to minimize a number of tardy jobs in the nonidentical parallel machine scheduling. The Tabu Search method employs a restricted neighborhood for the reduction of computation time. In this paper, we use two different types of method for a single machine scheduling. One is Moore's algorithm and the other is insertion method. We discuss computational experiments on more than 1000 test problems.

• Journal of the Korean Regional Science Association
• /
• v.14 no.1
• /
• pp.109-126
• /
• 1998

We analysed the determinants of part-timer labor demand and supply in Kwangju. The findings of the paper are as follows; First, firms employ part-timer workers in the unskilled or skilled jobs not demanding much training cost. There are two reasons for firms to employ part-time workers: labor cost cut and flexible employment adjustment. Estimated wage differential is 40% not including fringe benefits differential. Second, we find lots of married women to want part-time jobs. The more probably married women choose part-time work, the younger and the less educated they are, and the less kids and the less other income they have.

• IE interfaces
• /
• v.16 no.spc
• /
• pp.132-137
• /
• 2003

We consider scheduling jobs on multipurpose machines where jobs can be processed by a subset of the machines operated in parallel with the objective of minimizing makespan. We apply LPT(Longest Processing Time first) algorithm and prove that its posterior worst-case performance ratio is at most $log_24m/(1+{\lambda})$, where \lambda is the number of machines eligible for processing the job with the latest completion time. In general, LPT is shown to always find a schedule with makespan at most $log_24m/3$ times optimum.

• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.4
• /
• pp.137-146
• /
• 1993

We consider single server feedback queueing systems with priorities. In the model, there are J stations and job classes. Jobs of class i arrive at station i according to a Poisson process, and have a general service time distribution. We derive the generating functions of the number of jobs at each station just after a busy period and the formula for the mean sojourn time that a specific tagged job spends at station j from its arrival to departure from the system.

• International Journal of Costume and Fashion
• /
• v.14 no.1
• /
• pp.47-62
• /
• 2014

People today belong to many different subcultures and have diverse interests. Their job no longer defines who they are, while their pastimes can be a bigger reflection of their inner self. This article examines swing dancers in Korea, and focuses on their self-identity and how they express this through clothes. Based on in-depth interviews, observations and photographs of swing dancers with different day jobs, the study results find that most of the subjects intentionally incorporate swing dance cues in their daily work wardrobe, and that this makes them feel more comfortable, honest and satisfied with their job and identity, both as a swing dancer and working professional.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.2
• /
• pp.7-12
• /
• 2006

This study considers the problem of scheduling jobs on uniform parallel machines with a common due date. The objective is to minimize the total absolute deviation of job completion times about the common due date. This problem is motivated by the fact that a certain phase of printed circuit board manufacturing is bottleneck and the processing speeds of parallel machines in this phase are uniformly different for all jobs. Optimal properties are proved and a simple polynomial time optimal algorithm is developed.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.14 no.23
• /
• pp.27-36
• /
• 1991

This paper considers scheduling a set of n-jobs on m-paraller identical processors in which all jobs have the common due date. The objective of the problem is to minimize the weighted mean absolute deviation of job completion times about such common due dates under the assumption that each job has a different weight. and to determine the optimal value of a common due date. We propose four heuristic solution methods based on several dominance conditions, and its solution procedure is illustrated with numerical examples. The Performance comparison is made among four heuristic scheduling procedures.