scholarly journals A Dynamic Scheduling Method for Painting Process with JIT Production System

2000 ◽  
Vol 13 (2) ◽  
pp. 65-71
Author(s):  
Jae Kyu Yoo ◽  
Masafumi NOGUCHI ◽  
Itsuo HATONO ◽  
Shinji TOMIYAMA ◽  
Hiroyuki TAMURA
Keyword(s):  
Production System ◽  
Dynamic Scheduling ◽  
Scheduling Method ◽  
Jit Production ◽  
Painting Process

scholarly journals A Building-Block-Based Genetic Algorithm for Solving the Robots Allocation Problem in a Robotic Mobile Fulfilment System

2019 ◽  
Vol 2019 ◽  
pp. 1-15
Author(s):  
Jingtian Zhang ◽  
Fuxing Yang ◽  
Xun Weng
Keyword(s):  
Genetic Algorithm ◽  
Dynamic Scheduling ◽  
Building Blocks ◽  
Allocation Problem ◽  
Accurate Analysis ◽  
Allocation Problems ◽  
Scheduling Method ◽  
Project Scheduling Problem ◽  
Block Based ◽  
Better Than

Robotic mobile fulfilment system (RMFS) is an efficient and flexible order picking system where robots ship the movable shelves with items to the picking stations. This innovative parts-to-picker system, known as Kiva system, is especially suited for e-commerce fulfilment centres and has been widely used in practice. However, there are lots of resource allocation problems in RMFS. The robots allocation problem of deciding which robot will be allocated to a delivery task has a significant impact on the productivity of the whole system. We model this problem as a resource-constrained project scheduling problem with transfer times (RCPSPTT) based on the accurate analysis of driving and delivering behaviour of robots. A dedicated serial schedule generation scheme and a genetic algorithm using building-blocks-based crossover (BBX) operator are proposed to solve this problem. The designed algorithm can be combined into a dynamic scheduling structure or used as the basis of calculation for other allocation problems. Experiment instances are generated based on the characteristics of RMFS, and the computation results show that the proposed algorithm outperforms the traditional rule-based scheduling method. The BBX operator is rapid and efficient which performs better than several classic and competitive crossover operators.

Research of Flexible Dynamic Scheduling Problem Based on Genetic Algorithm

2009 ◽  
Vol 16-19 ◽  
pp. 743-747
Author(s):  
Yu Wu ◽  
Xin Cun Zhuang ◽  
Cong Xin Li
Keyword(s):  
Genetic Algorithm ◽  
Flexible Manufacturing ◽  
Manufacturing Systems ◽  
Dynamic Scheduling ◽  
Scheduling Problem ◽  
Static Scheduling ◽  
Coding Method ◽  
Scheduling Method ◽  
Distribution Principle ◽  
Working Procedure

Solve the flexible dynamic scheduling problem by using “dynamic management & static scheduling” method. Aim at the property of flexible Manufacturing systems, the dynamic scheduling methods are analyzed and a coding method based on working procedure is improved in this paper. Thus it can be efficiently solve the problem of multiple working routes selection under the active distribution principle. On the other hand, the self-adaptive gene is provided and the parameters of the genetic algorithm are defined. In such a solution, the scheduling is confirmed to be simple and efficient.

scholarly journals ANALISA PERBANDINGAN PENJADWALAN PRODUKSI DENGAN METODE CDS (CAMPBELL DUDEK SMITH), EDD (EARLIEST DUE DATE) DAN FCFS (FIRST COME FIRST SERVE) PADA PT. SARI WARNA ASLI UNIT V

2021 ◽  
Vol 1 (2) ◽  
pp. 46-51
Author(s):  
Dwi Ayu Lestari, Vikha Indira Asri
Keyword(s):  
Production Process ◽  
Production System ◽  
Production Scheduling ◽  
Job Shop ◽  
Allocation Of Resources ◽  
Due Date ◽  
Scheduling System ◽  
Make To Order ◽  
First Come First Serve ◽  
Scheduling Method

Scheduling is defined as the process of sequencing the manufacture of a product as a whole on several machines. All industries need proper scheduling to manage the allocation of resources so that the production system can run quickly and precisely as of it can produce optimal product. PT. Sari Warna Asli Unit V is one of the companies that implements a make to order production system with the FCFS system. Thus, scheduling the production process at this company is also known as job shop production scheduling. The methods used in this research are the CDS method, the EDD method and the FCFS method. The purpose of this research is to minimize the production time and determine the best method that can be applied to the company. The results of this research showed that the makespan obtained in the company's scheduling system with FCFS rules was 458 minutes, and the results of scheduling using the CDS method obtained a makespan value of 329 minutes, then the best production scheduling method that had the smallest makespan value was the CDS method.

Optimal numbers of two kinds of kanbans in a JIT production system

1995 ◽  
Vol 33 (5) ◽  
pp. 1387-1401 ◽  
Author(s):  
K. OHNO ◽  
K. NAKASHIMA ◽  
M. KOJIMA
Keyword(s):  
Production System ◽  
Jit Production

Elman Neural Network–Based Dynamic Scheduling of Wafer Photolithography Process

2011 ◽  
Vol 186 ◽  
pp. 36-40 ◽  
Author(s):  
Bing Hai Zhou
Keyword(s):  
Neural Network ◽  
Manufacturing System ◽  
Dynamic Scheduling ◽  
Learning Algorithm ◽  
Semiconductor Wafer ◽  
Simulation Experiments ◽  
Elman Neural Network ◽  
Scheduling Method ◽  
Photolithography Process ◽  
Wafer Manufacturing

Photolithography area is usually a bottleneck area in a semiconductor wafer manufacturing system (SWMS). It is difficult to schedule photolithography area on real-time optimally. Here, an Elman neural network (ENN)-based dynamic scheduling method is proposed. An ENN-based sample learning algorithm is proposed for selecting best combination of scheduling rules. To illustrate the feasibility and practicality of the presented method, the simulation experiment is developed. A numerical example is use to evaluate the proposed method. Results of simulation experiments show that the proposed method is effective to schedule a complex wafer photolithography process.

Sign in / Sign up

Export Citation Format

Share Document