• Title/Summary/Keyword: real-time job

Search Result 198, Processing Time 0.021 seconds

Development of Real-Time Inspection System for Foods Packaging Film using MMX Technology (MMX기술을 이용한 식품 포장용 투명필름의 실시간 검사시스템 개발)

  • Yoo, Joo-Hyun;Lee, Jae-Hyeok
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.156-158
    • /
    • 2004
  • Film printing companies have many problems during a printing process. Most of all, even an insect or dirt stick to the transparent film may cause severe errors until the end of printing job, which means big economic damage to the company. To prevent some insect-dots or dirt-dots, we have to Inspect the total area of film. However, it is very difficult to inspect the film in real-time due to the high-speed of printing that usually more than 150 m/min. A hardware based approach, for example DSP-based approach can be the one of solution candidates, but the total cost and the complexity increases the very high-level. In this paper, we suggest a software based approach, using MMX technology, to inspect the film in real-time. By Many real-plant experiments, we can see the suggest approach is applicable for the inspection of food packaging film in real-time.

  • PDF

Design of Scheduling System for Flexible Manufacturing Cells (FMC에서의 일정계획 시스템의 설계)

  • 신대혁;이상완
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.17 no.32
    • /
    • pp.63-71
    • /
    • 1994
  • The purpose of this paper is to describe an effective cell scheduling system for flexible manufacturing cells. Based on the FMC characteristics, cell scheduling can be defined as a dynamic modified flow shop working in a real-time system. This paper attempt to find the optimal cell scheduling when minimizing the mean flow time for n-job/m-machine problems in static and dynamic environments. Real-time scheduling in an FMC environment requires rapid computation of the schedule.

  • PDF

An Efficient Data Structure for Queuing Jobs in Dynamic Priority Scheduling under the Stack Resource Policy (Stack Resource Policy를 사용하는 동적 우선순위 스케줄링에서 작업 큐잉을 위한 효율적인 자료구조)

  • Han Sang-Chul;Park Moon-Ju;Cho Yoo-Kun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.6
    • /
    • pp.337-343
    • /
    • 2006
  • The Stack Resource Policy (SRP) is a real-time synchronization protocol with some distinct properties. One of such properties is early blocking; the execution of a job is delayed instead of being blocked when requesting shared resources. If SRP is used with dynamic priority scheduling such as Earliest Deadline First (EDF), the early blocking requires that a scheduler should select the highest-priority job among the jobs that will not be blocked, incurring runtime overhead. In this paper, we analyze the runtime overhead of EDF scheduling when SRP is used. We find out that the overhead of job search using the conventional implementations of ready queue and job search algorithms becomes serious as the number of jobs increases. To solve this problem, we propose an alternative data structure for the ready queue and an efficient job-search algorithm with O([log$_2n$]) time complexity.

A design of supervisory control system for a multi-robot system (다중로봇을 휘한 관리제어 시스템의 설계)

  • 서일홍;여희주;김재현;류종석;오상록
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.45 no.1
    • /
    • pp.100-112
    • /
    • 1996
  • This paper presents a design experience of a control language for coordination of a multi-robot system. To effectively program job commands, a Petrinet-type Graphical Robot Language(PGRL) is proposed, where some functions, such as concurrency and synchronization, for coordination among tasks can be easily programmed.In our system, the proposed task commands of PGRL are implemented by employing formal model languages, which are composed of three modules, sensory, data handling, and action module. It is expected that by using our proposed PGRL and formal languages, one can easily describe a job or task, and hence can effectively operate a complex real-time and concurrent system. The control system is being implemented by using VME-based 32-bit microprocessor boards for supervisory, each module controller(arm, hand, leg, sensor data processing module) and a real time multi-tasking operating system(VxWorks). (author). 17 refs., 16 figs., 2 tabs.

  • PDF

The Effects of Online Real-time Constuctivist Practical Trainings in an IT Company (IT 기업의 구성주의 교수학습환경 기반 실시간 온라인 실습 교육 효과 분석)

  • Ahn, Seulki;Lee, Myunggeun
    • Journal of Engineering Education Research
    • /
    • v.27 no.2
    • /
    • pp.25-34
    • /
    • 2024
  • Due to the Covid-19 pandemic, it seems to have been impossible to run offline training courses. To overcome this situation, online training courses has been emerged. Just moving the educational environment from offline to online instead of re-designing the curriculum, however, is not effective for trainees. To maximize educational effectiveness, it is necessary to re-design the curriculum based on constructivist appoach which gives trainees experience on skills and knowledge about their job. As for re-designing the curriculum into real-time online practical learning based on constructivism, learning satisfaction and work efficacy of trainees may have been increased. From these results, HRD professionals in an IT company should need to consider how to structure the curriculum when they design the real-time online practical learnings.

A Reconfigurable Scheduler Model for Supporting Various Real-Time Scheduling Algorithms (다양한 실시간 스케줄링 알고리즘들을 지원하기 위한 재구성 가능한 스케줄러 모델)

  • Shim, Jae-Hong;Song, Jae-Shin;Choi, Kyung-Hee;Park, Seung-Kyu;Jung, Gi-Hyun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.4
    • /
    • pp.201-212
    • /
    • 2002
  • This paper proposes a reconfigurable scheduler model that can support various real-time scheduling algorithms. The proposed model consists of two hierarchical upper and lower components, task scheduler and scheduling framework, respectively. The scheduling framework provides a job dispatcher and software timers. The task scheduler implements an appropriate scheduling algorithm, which supports a specific real-time application, based on the scheduling framework. If system developers observe internal kernel interfaces to communicate between two hierarchical components, they can implement a new scheduling algorithm independent of complex low kernel mechanism. Once a task scheduler is developed, it can be reused in a new real-time system in future. In Real-Time Linux (5), we implemented the proposed scheduling framework and several representative real-time scheduling algorithms. Throughout these implementations, we confirmed that a new scheduling algorithm could be developed independently without updates of complex low kernel modules. In order to confirm efficiency of the proposed model, we measured the performance of representative task schedulers. The results showed that the scheduling overhead of proposed model, which has two separated components, is similar to that of a classic monolithic kernel scheduler.

A Synchronized Job Assignment Model for Manual Assembly Lines Using Multi-Objective Simulation Integrated Hybrid Genetic Algorithm (MO-SHGA) (다목적 시뮬레이션 통합 하이브리드 유전자 알고리즘을 사용한 수동 조립라인의 동기 작업 모델)

  • Imran, Muhammad;Kang, Changwook
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.40 no.4
    • /
    • pp.211-220
    • /
    • 2017
  • The application of the theoretical model to real assembly lines has been one of the biggest challenges for researchers and industrial engineers. There should be some realistic approach to achieve the conflicting objectives on real systems. Therefore, in this paper, a model is developed to synchronize a real system (A discrete event simulation model) with a theoretical model (An optimization model). This synchronization will enable the realistic optimization of systems. A job assignment model of the assembly line is formulated for the evaluation of proposed realistic optimization to achieve multiple conflicting objectives. The objectives, fluctuation in cycle time, throughput, labor cost, energy cost, teamwork and deviation in the skill level of operators have been modeled mathematically. To solve the formulated mathematical model, a multi-objective simulation integrated hybrid genetic algorithm (MO-SHGA) is proposed. In MO-SHGA each individual in each population acts as an input scenario of simulation. Also, it is very difficult to assign weights to the objective function in the traditional multi-objective GA because of pareto fronts. Therefore, we have proposed a probabilistic based linearization and multi-objective to single objective conversion method at population evolution phase. The performance of MO-SHGA is evaluated with the standard multi-objective genetic algorithm (MO-GA) with both deterministic and stochastic data settings. A case study of the goalkeeping gloves assembly line is also presented as a numerical example which is solved using MO-SHGA and MO-GA. The proposed research is useful for the development of synchronized human based assembly lines for real time monitoring, optimization, and control.

Improvement the Security Service of Cash Delivery Using Real-time Binary CDMA Monitoring (실시간 Binary CDMA 모니터링을 통한 현금호송 보안업무 개선방안)

  • Kim, Min-Su;Lee, Dong-Hwi;Kim, Kui-Nam J.
    • Convergence Security Journal
    • /
    • v.12 no.2
    • /
    • pp.53-60
    • /
    • 2012
  • Financial institutions keep putting efforts to filling cash into ATMs and branches in order to provide customers with better service. This kind of job usually required an automobile unit to be done, and financial institutions employee perform this task directly or sourcing out to professional security service companies. However, the job has been of ten a target of criminals because it deals with cash. In fact, since 2003, there were several cash truck robberies occurred. This circumstances made the public be aware of the necessity of creative research and the strict management of financial institutions and security companies. However, the existing studies on security service of cash delivery suggest only how to improve the job legally and in operation, and the technological aspect of the improving way has not been studied. Therefore, this study aimed at suggesting an improvement the security service of cash delivery using real-time binary CDMA monitoring for providing better safety service to customers.

Inference Interpretation of Job Data using Ontology (온톨로지를 이용한 일자리 데이터의 추론 해석)

  • Kim, Kwangje;Kim, Jeong Ho
    • Journal of Platform Technology
    • /
    • v.10 no.3
    • /
    • pp.69-78
    • /
    • 2022
  • Job offer and job search data related to employment are in the form of highly-unstructured texts that occur in real-time, NCS duty, learning modules, and job dictionaries. Job announcements and training information have a high data value amid changes in industrial technology, such as the Fourth Industrial Evolution. This study developed a job data dictionary by defining relevant data to intuitively understand and harness information on job offers and job searches. This study also designed, constructed, and evaluated a data map based on ontology to enable linking and inferring data about public announcement-job-training. Through this, it was found that the inference function centered on work ability enables QoS support that can satisfy users by minimizing mismatch between consumers and optimizing the data dictionary.

Real-Time Job Scheduling Strategy for Grid Computing (그리드 컴퓨팅을 위한 실시간 작업 스케줄링 정책)

  • Choe, Jun-Young;Lee, Won-Joo;Jeon, Chang-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.2
    • /
    • pp.1-8
    • /
    • 2010
  • In this paper, we propose a scheduling strategy for grid environment that reduces resource cost. This strategy considers resource cost and job failure rate to efficiently allocate local computing resources. The key idea of our strategy is that we use two-level scheduling using remote and local scheduler. The remote scheduler determines the expected total execution times of jobs using the current network and local system status maintained in its resource database and allocates jobs with minimum total execution time to local systems. The local scheduler recalculates the waiting time and execution time of allocated job and uses it to determine whether the job can be processed within the specified deadline. If it cannot finish in time, the job is migrated other local systems, through simulation, we show that it is more effective to reduce the resource cost than the previous Greedy strategy. We also show that the proposed strategy improves the performance compared to previous Greedy strategy.