• 한국경영과학회지
• /
• 제27권2호
• /
• pp.97-109
• /
• 2002

Manufacturing environments in the real world are subject to many sources of change and uncertainty, such as new job releases, job cancellations, a chance in the processing time or start time of some operation. Thus, the realistic scheduling method should Properly reflect these dynamic environment. Based on the release times of jobs, JSSP (Job Shoe Scheduling Problem) can be classified as static and dynamic scheduling problem. In this research, we mainly consider the dynamic JSSP with continually arriving jobs. The goal of this research is to develop an efficient scheduling method based on GA (Genetic Algorithm) to address dynamic JSSP. we designed scheduling method based on SGA (Sing1e Genetic Algorithm) and PGA (Parallel Genetic Algorithm) The scheduling method based on GA is extended to address dynamic JSSP. Then, This algorithms are tested for scheduling and rescheduling in dynamic JSSP. The results is compared with dispatching rule. In comparison to dispatching rule, the GA approach produces better scheduling performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권8호
• /
• pp.2993-3010
• /
• 2021

The job shop scheduling problem (JSSP) plays a critical role in smart manufacturing, an effective JSSP scheduler could save time cost and increase productivity. Conventional methods are very time-consumption and cannot deal with complicated JSSP instances as it uses one optimal algorithm to solve JSSP. This paper proposes an effective scheduler based on deep learning technology named self-supervised long-short term memory (SS-LSTM) to handle complex JSSP accurately. First, using the optimal method to generate sufficient training samples in small-scale JSSP. SS-LSTM is then applied to extract rich feature representations from generated training samples and decide the next action. In the proposed SS-LSTM, two channels are employed to reflect the full production statues. Specifically, the detailed-level channel records 18 detailed product information while the system-level channel reflects the type of whole system states identified by the k-means algorithm. Moreover, adopting a self-supervised mechanism with LSTM autoencoder to keep high feature extraction capacity simultaneously ensuring the reliable feature representative ability. The authors implemented, trained, and compared the proposed method with the other leading learning-based methods on some complicated JSSP instances. The experimental results have confirmed the effectiveness and priority of the proposed method for solving complex JSSP instances in terms of make-span.

• 경영과학
• /
• 제20권1호
• /
• pp.51-64
• /
• 2003

The JSSP (Job Shop Scheduling Problem) Is one of the most general and difficult of all traditional scheduling problems. The goal of this research is to develop an efficient scheduling method based on genetic algorithm to address JSSP. we design scheduling method based on SGA (Single Genetic Algorithm) and PGA (Parallel Genetic Algorithm). In the scheduling method, the representation, which encodes the job number, is made to be always feasible, initial population is generated through integrating representation and G&T algorithm, the new genetic operators and selection method are designed to better transmit the temporal relationships in the chromosome, and island model PGA are proposed. The scheduling method based on genetic algorithm are tested on five standard benchmark JSSPs. The results were compared with other proposed approaches. Compared to traditional genetic algorithm, the proposed approach yields significant improvement at a solution. The superior results indicate the successful Incorporation of generating method of initial population into the genetic operators.

• 산업경영시스템학회지
• /
• 제23권59호
• /
• pp.11-20
• /
• 2000

The Job Shop Scheduling Problem(JSSP) is one of the most general and difficult of all traditional scheduling problems. The goal of this research is to develop an efficient scheduling method based on single genetic algorithm(SGA) and parallel genetic algorithm (PGA) to address JSSP. In this scheduling method, new genetic operator, generating method of initial population are developed and island model PGA are proposed. The scheduling method based on PGA are tested on standard benchmark JSSP. The results were compared with SGA and another GA-based scheduling method. The PGA search the better solution or improves average of solution in benchmark JSSP. Compared to traditional GA, the proposed approach yields significant improvement at a solution.

• International Journal of Computer Science & Network Security
• /
• 제22권8호
• /
• pp.45-54
• /
• 2022

In this study, a multi-objective robust job-shop scheduling (JSS) model was developed. The model considered multi-jobs and multi-machines. The model also considered uncertain processing times for all tasks. Each job was assigned a specific due date and a tardiness penalty to be paid if the job was not delivered on time. If any job was completed early, holding expenses would be assigned. In addition, the model added idling penalties to accommodate the idling of machines while waiting for jobs. The problem assigned was to determine the optimal start times for each task that would minimize the expected penalties. A numerical problem was solved to minimize both the makespan and the total penalties, and a comparison was made between the results. Analysis of the results produced a prescription for optimizing penalties that is important to be accounted for in conjunction with uncertainties in the job-shop scheduling problem (JSSP).

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 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.

• 산업경영시스템학회지
• /
• 제25권2호
• /
• pp.92-101
• /
• 2002

The Job Shop Scheduling Problem(JSSP) is concerned with schedule of m different machines and n jobs where each job consists of a chain of operations, each of which needs to be processed during an uninterrupted time period of a given length on a given machine. The purpose of this paper is to develop the efficient heuristic method for solving the minimum makespan problem of the large scale job shop scheduling. The proposed heuristic method is based on a Tabu Search(TS) and on a Constraint Satisfaction Technique(CST). In this paper, ILOG libraries is used to embody the job shop model, and a CST is developed for this model to generate the increased solution. Then, TS is employed to overcome the increased search time of CST on the increased problem size md to refine the next-current solution. Also, this paper presents the new way of finding neighbourhood solution using TS. On applying TS, a new way of finding neighbourhood solution is presented. Computational experiments on well known sets of MT and LA problem instances show that, in several cases, our approach yields better results than the other heuristic procedures discussed In literature.