• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1990년도 춘계공동학술대회논문집; 한국과학기술원; 28 Apr. 1990
• /
• pp.220-221
• /
• 1990

The objective of this study is to determine a near-optimal time schedule for processing necessary jobs in order to minimize total elapsed time. The fundamental assumptions are that jobs to be processed are classified into several groups and jobs within the same group are processed in succession in the flow-type GT line. A heuristic method by V. A. Petrov is applied to determine the job sequencing. In consideration of production quantity, group sequences and job sequences for each group are determined and the start time of processing for each job is calculated by computer.

• 산업경영시스템학회지
• /
• 제36권4호
• /
• pp.130-137
• /
• 2013

In this paper, we consider a two-agent scheduling with sequence-dependent exponential learning effects consideration, where two agents A and B have to share a single machine for processing their jobs. The objective function for agent A is to minimize the total completion time of jobs for agent A subject to a given upper bound on the objective function of agent B, representing the makespan of jobs for agent B. By assuming that the learning ratios for all jobs are the same, we suggest an enumeration-based backward allocation scheduling for finding an optimal solution and exemplify it by using a small numerical example. This problem has various applications in production systems as well as in operations management.

• 산업기술연구
• /
• 제28권A호
• /
• pp.43-49
• /
• 2008

The track of high-speed railway get deteriorated according as using it. In that case, the maintenance jobs are needed for improvement of track quality. A scheduling problem for the track maintenance of high-speed railway is to determine the jobs should be performed daily. In the problem, the set of jobs for maintenance is given. Each job has it's parameters such as due date, emergency level, and processing time. In addition, jobs can be worked during a certain fixed time when the train doesn't move. In this study, we developed a mathematical model of the scheduling problem for the maintenance of high-speed railway and solved the problem using the ILOG CPLEX library.

• 대한가정학회지
• /
• 제35권1호
• /
• pp.205-220
• /
• 1997

The purpose of this study is to explore the housework sharing between husbands and wives with special reference to wives' jobs, Using couple data from a sample of 370 dual-earner couples and 250 husband-only employed couples multiple regression analysis was used. Major findings were as follows: 1) Husbands of the dual-earner couples participated in housework a little more than husbands of the husband-only employed couples did. 2) The husbands whose wives' jobs are office workers tended to share housework more than the husbands whose wives' jobs are professionals or blue collars did. 3) Among the variables which significantly affect housework sharing husbands' sex role attitude is the most influential factor and each partner's working hours a week has also significant effect. I suggested that more studies are needed to explore the relationship between the housework sharing and marital quality in order to identify and to lessen the stresses between husband and wife.

• 한국측량학회:학술대회논문집
• /
• 한국측량학회 2006년도 춘계학술발표회 논문집
• /
• pp.15-20
• /
• 2006

For grouping the direction of improvement in the classification of surveying jobs, watching for internal surveying jobs, it has a purpose to present the direction of improvement. KSCO based on ISCO-88 was identifed with having independent special surveyors differing from foreign surveying jobs classification. Strandard Industry Classification of foreign survey is classifying KSCO of survey detailed. thus, the improvement of survey jobs classification of KSCO is urgent to produce, analyze and process the data about the same field for classifying survey information industry efficiently and systematically. It is changing from analog survey to digital survey applying a new technology such as GPS, GIS, RS. thus, the field of geoinformation is needed to classify and improve newly.

• 품질경영학회지
• /
• 제38권1호
• /
• pp.52-63
• /
• 2010

The purpose of this study is to investigate whether or not belt's jobs represent a source of job enrichment that translates into positive job characteristics and satisfaction. Hackman and Oldham's 5 job characteristics, 3 critical psychological states and MPS are utilized for analyzing results of the study. The results indicate that Black and Master Black Belt's jobs have positive effects on all five job characteristics, 3 psychological states, and MPS score. However, the findings indicate that Black and Master Black Belt's jobs are no direct effect on job satisfaction suggesting that growth need strength controls on job satisfaction. The result shows that there is a support for the prediction that growth needs strength controls the effect of belt's jobs on job satisfaction.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1993년도 춘계공동학술대회 발표논문 및 초록집; 계명대학교, 대구; 30 Apr.-1 May 1993
• /
• pp.6-15
• /
• 1993

A generalization of one machine maximum lateness minimization problem is considered. There are one achine with controllable speed and n weighting jobs $J_{j}$, j=1, 2, ..., n with ambiguous duedates. Introducing fuzzy formulation, a membership function of the duedate associated with each job $J_{j}$, which describes the satisfaction level with respect to completion time of $J_{j}$. Thus the duedates are not constants as in conventional scheduling problems but decision variables reflecting the fuzzy circumstance of the job completing. We develop the polynomial time algorithm to find an optimal schedule and jobwise machine speeds, and to minimize the total sum of costs associated with jobwise machine speeds and dissatisfaction with respect to completion times of weighting jobs. jobs.

• 산업공학
• /
• 제15권4호
• /
• pp.338-348
• /
• 2002

In this paper, we present a restricted tabu search(RTS) algorithm that schedules jobs on identical parallel machines in order to minimize the maximum lateness of jobs. Jobs have release times and due dates. Also, sequence-dependent setup times exist between jobs. The RTS algorithm consists of two main parts. The first part is the MATCS(Modified Apparent Tardiness Cost with Setups) rule that provides an efficient initial schedule for the RTS. The second part is a search heuristic that employs a restricted neighborhood generation scheme with the elimination of non-efficient job moves in finding the best neighborhood schedule. The search heuristic reduces the tabu search effort greatly while obtaining the final schedules of good quality. The experimental results show that the proposed algorithm gives better solutions quickly than the existing heuristic algorithms such as the RHP(Rolling Horizon Procedure) heuristic, the basic tabu search, and simulated annealing.

• 대한교통학회지
• /
• 제13권3호
• /
• pp.5-17
• /
• 1995

One of interesting issues in urban land-use and transportation policy is about an unproven belief that imbalances between employment and residential sites strongly influence urban commuting patterns. The purpose of this study si to find how spatial distribution of jobs and housing affects commuting distances in Seoul Metropolitan Area using 1990 Census O-D Data. This study estimates cost-minimizing required commuting distance, given the actual distributions of jobs and housing , and compares required commuting distances with actual commuting distances. One of findings is that the standard urban economic theory explains only 1/3 of actual commuting in the case study area. The policy implication of this study is that jobs-housing balance policy will have only a minor effect on the actual commuting.

• 한국경영과학회지
• /
• 제26권2호
• /
• pp.69-83
• /
• 2001

The problem of minimizing total tardiness on a batch processing machine with incompatible job families when there are sequence independent setup times between families is studied where all jobs of the same family have identical processing times and jobs of different families cannot be processed together. A batch processing machine can process a number of jobs, within a maximal batch size, simultaneously as a batch. The processing time required of each batch is equal to the one of jobs. A dynamic programming algorithm which gives the optimal solution, and several heuristics are presented. Performance of simple dispatching rules based on due dates are compared, and the best of them is used as an initial solution for the decomposition algorithm, which is shown to give good schedules in relatively short computational time.