• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1998년도 추계학술대회 논문집
• /
• pp.209-213
• /
• 1998

Job-Shop Scheduling 문제는 전형적인 NP-hard 문제로서 효율적인 발견적 기법을 필요로 한다. 본 연구에서는 이 문제에 대한 유전알고리즘들의 성능을 비교 분석한다. 유전 알고리즘의 주요 구성 요소들로는 크게 선별, 교차, 돌연변이 등이 존재하는데, 특히 선별은 적자 생존의 자연 법칙에 기초하여, 환경에 대한 적응도에 의해 현 세대의 모집단으로부터 다음 세대에 생존할 개체를 선택하는 과정으로 해의 산출에 중요한 역할을 하는 부분이다. 기존의 많은 연구들이 유전 연산자인 교차, 돌연변이 방법들에 대한 성능 비교에 초점을 맞추었는데, 본 연구에서는 선별 과정에 초점을 맞추어 기존의 알려진 여러 선별 방법 들을Job-Shop Scheduling 문제에의 적용을 통해 비교 분석하고 새로운 선별 방법을 제안한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권4호
• /
• pp.1258-1275
• /
• 2023

Cloud computing is a new technology that has adapted to the traditional way of service providing. Service providers are responsible for managing the allocation of resources. Selecting suitable containers and bandwidth for job scheduling has been a challenging task for the service providers. There are several existing systems that have introduced many algorithms for resource allocation. To overcome these challenges, the proposed system introduces an Optimized Task Scheduling Algorithm with Deep Learning (OTS-DL). When a job is assigned to a Cloud Service Provider (CSP), the containers are allocated automatically. The article segregates the containers as' Long-Term Container (LTC)' and 'Short-Term Container (STC)' for resource allocation. The system leverages an 'Optimized Task Scheduling Algorithm' to maximize the resource utilisation that initially inquires for micro-task and macro-task dependencies. The bottleneck task is chosen and acted upon accordingly. Further, the system initializes a 'Deep Learning' (DL) for implementing all the progressive steps of job scheduling in the cloud. Further, to overcome container attacks and errors, the system formulates a Container Convergence (Fault Tolerance) theory with high-level security. The results demonstrate that the used optimization algorithm is more effective for implementing a complete resource allocation and solving the large-scale optimization problem of resource allocation and security issues.

• Industrial Engineering and Management Systems
• /
• 제7권2호
• /
• pp.84-92
• /
• 2008

Scheduling is one of the most important issues in the planning and operation of production systems. This paper investigates a general job shop scheduling problem with reentrant work flows and sequence dependent setup times. The disjunctive graph representation is used to capture the interactions between machines in job shop. Based on this representation, four two-phase heuristic procedures are proposed to obtain near optimal solutions for this problem. The obtained solutions in the first phase are substantially improved by reversing the direction of some critical disjunctive arcs of the graph in the second phase. A comparative study is conducted to examine the performance of these proposed algorithms.

• Industrial Engineering and Management Systems
• /
• 제10권1호
• /
• pp.7-14
• /
• 2011

In solving the Job Shop Scheduling Problem, the best solution rarely is completely random; it follows one or more rules (heuristics). The Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Simulated Annealing, and Tabu search, which belong to the Evolutionary Computations Algorithms (ECs), are not efficient enough in solving this problem as they neglect all conventional heuristics and hence they need to be hybridized with different heuristics. In this paper a new algorithm titled "Shaking Optimization Algorithm" is proposed that follows the common methodology of the Evolutionary Computations while utilizing different heuristics during the evolution process of the solution. The results show that the proposed algorithm outperforms the GA, PSO, SA, and TS algorithms, while being a good competitor to some other hybridized techniques in solving a selected number of benchmark Job Shop Scheduling problems.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
• /
• pp.609-612
• /
• 2000

Job-shop scheduling problem(JSSP) is one of the best-known machine scheduling problems and essentially an ordering problem. A new encoding scheme which always give a feasible schedule is presented, by which a schedule directly corresponds to an assigned-operation ordering string. It is initialized with G&T algorithm and improved using the developed genetic operator; APMX or BPMX crossover operator and mutation operator. and the problem of infeasibility in genetic generation is naturally overcome. Within the framework of the newly designed genetic algorithm, the NP-hard classical job-shop scheduling problem can be efficiently solved with high quality. Moreover the optimal solutions of the famous benchmarks, the Fisher and Thompson's 10${\times}$10 and 20${\times}$5 problems, are found.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1996년도 추계학술대회발표논문집; 고려대학교, 서울; 26 Oct. 1996
• /
• pp.303-306
• /
• 1996

This paper proposes a heuristic method for job shop scheduling with alternative machines. Our heuristic suggests four machine-selecting rules and two priority dispatching rules for modifying existent ones considering alternative machines, and then it extends existing nondelay/active job shop schedule generation. This heuristic provides good criteria(rules) in the selection of a proper machine among those performing a specific operation and for the dispatch of an operation to a selected machine and thus these rules permit the efficient job shop scheduling with alternative machines. The performances of our four machine-selecting rules in addition to the two priority dispatching rules, applied together with the existing 17 rules, are experimented and evaluated, respectively.

• 산업경영시스템학회지
• /
• 제27권2호
• /
• pp.17-23
• /
• 2004

Changes in manufacturing system are those that occur during production and cause the systems to behave unpredictably. So scheduling problem in this dynamic Industrial environments is very complex. The main concept of this dissertation is to continuously monitor a manufacturing system status(Rate of Prior Job, Rate of Large Job, Rate of Shortest due date Job, Job Interval Time) and detect or predict a change so that scheduling system will react by modifying production schedule(dispaching rule) to lessen the effects of this change.

• Management Science and Financial Engineering
• /
• 제9권2호
• /
• pp.47-68
• /
• 2003

We consider the customer order scheduling problem with job capacity restriction where the number of jobs in the shop at the same time is fixed. In the customer order scheduling problem, each job is part of some batch (customer order) and the composition of the jobs (product) in the batch is pre-specified. The objective function is associated with the completion time of the batches instead of the completion time of the jobs. We first summarize the known results for the general customer order scheduling problems. Then, we establish some new properties for the problems with job capacity restriction. For the case of unit processing time with the objective of minimizing makespan, we develop a polynomial-time optimal procedure for the two machine case. For the same problem with a variation of no batch alternation, we also develop a polynomial-time optimal procedure. Then, we show that the problems with the objectives of minimizing makespan and minimizing average batch completion time become NP-hard when there exist arbitrary number of machines. Finally, We propose optimal solution procedures for some special cases.

• 산업경영시스템학회지
• /
• 제29권4호
• /
• pp.107-112
• /
• 2006

This study presents the new dispatching rules for improving performance measures of job shop scheduling related to completion time and due dates. The proposed dispatching rule considers information, which includes the comparison value of job workload, work remaining, operation time, and operation due dates. Through computer experiments, the performance of the new dispatching rules is compared and analyzed with the existing rules. The results provide a guidance for the researchers to develop new dispatching rules and for practitioners to choose rules of job shop scheduling.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1992년도 춘계공동학술대회 발표논문 및 초록집; 울산대학교, 울산; 01월 02일 May 1992
• /
• pp.247-247
• /
• 1992