• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2018년도 제58차 하계학술대회논문집 26권2호
• /
• pp.47-48
• /
• 2018

본 논문에서는 NP-hard 문제로 알려진 잡샵 스케쥴링에 대하여 강화학습적 측면에서 접근하는 방식에 대해 제안한다. 다양한 시간이 소요되는 업무들이 가지는 특징들을 최대한 state space aggregation에 고려하고, 이를 neural network를 통해 최적화 시간을 줄이는 방식이다. 잡샵 스케쥴링에 대한 솔루션은 미래에 대한 예측이 불가능하고 다양한 시간이 소요되는 스케쥴링 문제를 최적화하는 것에 대한 가능성을 제시할 것으로 기대된다.

• 산업경영시스템학회지
• /
• 제42권1호
• /
• pp.33-40
• /
• 2019

This study focuses on a job-shop scheduling problem with the objective of minimizing total tardiness for the job orders that have different due dates and different process flows. We suggest the dispatching rule based scheduling algorithm to generate fast and efficient schedule. First, we show the delay schedule can be optimal for total tardiness measure in some cases. Based on this observation, we expand search space for selecting the job operation to explore the delay schedules. That means, not only all job operations waiting for process but also job operations not arrived at the machine yet are considered to be scheduled when a machine is available and it is need decision for the next operation to be processed. Assuming each job operation is assigned to the available machine, the expected total tardiness is estimated, and the job operation with the minimum expected total tardiness is selected to be processed in the machine. If this job is being processed in the other machine, then machine should wait until the job arrives at the machine. Simulation experiments are carried out to test the suggested algorithm and compare with the results of other well-known dispatching rules such as EDD, ATC and COVERT, etc. Results show that the proposed algorithm, MET, works better in terms of total tardiness of orders than existing rules without increasing the number of tardy jobs.