The Production Scheduling Problem of Aluminum Casting Based on Theory of Constraints

2011 ◽  
Vol 403-408 ◽  
pp. 3666-3670
Author(s):  
Pin Peng ◽  
En Hu Chen
Keyword(s):  
Production Process ◽  
Production Scheduling ◽  
Theory Of Constraints ◽  
Aluminum Production ◽  
Scheduling Problem ◽  
Optimization Strategy ◽  
Aluminum Casting ◽  
Scheduling Model ◽  
Process Constraints

Based on explaining characteristics of aluminum production process and management, this paper built a production scheduling model of the aluminum casting with its equipment constrains and process constraints, discussed the optimization strategy of the production scheduling for aluminum casting.

Bi-Level Quantum Evolutionary Algorithm for Scheduling of Dynamic Alliance

2009 ◽  
Vol 626-627 ◽  
pp. 783-788 ◽  
Author(s):  
W.L. Wang ◽  
S.X. Chen ◽  
Yan Wei Zhao ◽  
J.L. Zhang ◽  
H.Y. Wang
Keyword(s):  
Evolutionary Algorithm ◽  
Production Process ◽  
Production Scheduling ◽  
The Other ◽  
Scheduling System ◽  
Dynamic Alliance ◽  
Scheduling Model ◽  
The Relationship

The plan scheduling is an important part for forming a dynamic alliance on the ASP platform. In order to solve this problem, in the first place, a scheduling model of multi-objectives and multi-enterprise has been developed. The scheduling objectives of this model considered the enterprise credibility, production tasks, production process and the relationship between them. Secondly, a bi-level quantum evolutionary algorithm is provided for this model. One level is the coding of processes that determines the sequence of process. The other level is the coding of bidding enterprise that chooses each procedure of bidding enterprise. This scheduling approach in an ASP platform realizing dynamic alliance production scheduling system has been applied actually. And the approach can get faster convergence and better characteristics.

Research on Production Scheduling Problems in Process Industry Based on Ant Colony System

2010 ◽  
Vol 108-111 ◽  
pp. 519-524
Author(s):  
Lie Ping Zhang ◽  
Yun Sheng Zhang
Keyword(s):  
Production Scheduling ◽  
Stochastic Scheduling ◽  
Ant Colony ◽  
Process Industry ◽  
Process Time ◽  
Ant Colony System ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Process Step ◽  
Scheduling Model

In order to improve the production of process industry, the ant colony system(ACS) was applied to the production scheduling problem. Based on the analysis of the production scheduling problem for process industry, a production scheduling model was established, whose goal was to obtain the shortest total process time. The search strategy, heuristic information rules, pheromone updating mechanism, process step starting time and detailed algorithm implementation of ACS were discussed. Using a practical production scheduling problem as an example, the established model and designed algorithm were applied to implement the scheduling simulation. The simulation results show that the scheduling model and algorithm are feasible, and have a better scheduling performance than the stochastic scheduling method, and can be applied to solve practical production scheduling problem for process industry.

Linear Rail Space Dynamic Scheduling Technology for Multi-Tasking Hybrid Assembly Sections

2012 ◽  
Vol 271-272 ◽  
pp. 650-656
Author(s):  
Zhi Bing Lu ◽  
Ai Min Wang ◽  
Cheng Tong Tang ◽  
Jing Sheng Li
Keyword(s):  
Production Scheduling ◽  
Dynamic Scheduling ◽  
Scheduling Algorithm ◽  
Real Data ◽  
Utilization Rate ◽  
Filter Method ◽  
Scheduling Problem ◽  
Rule Based ◽  
Comprehensive Utilization ◽  
Space Production

For the rapid response to production scheduling problem driven by high-density production tasks, a dynamic scheduling technology for the large precision strip products assembly with a mixture of task time nodes and line-rail space is proposed. A scheduling constrained model containing coverage, proximity, timeliness and resource is established. A linear rail space production scheduling technology using heuristic automatic scheduling and event-driven method is put forward. The time rule based on delivery and single completion assembly is formed, at the same time the space rule based on the adjacent rail and comprehensive utilization is researched. Supposing the privilege of single product assembling as the core, the scheduling parts filter method based on multiple constraints and former rules. For the space layout problem, a clingy forward and backward algorithms is proposed to judge the assemble position regarding the space comprehensive utilization rate. The classification of the various disturbances in the actual production is summarized. Three basic algorithms are proposed, including insertion, moving and re-scheduling algorithm, in order to solve the assembly dynamic scheduling problem driven by production disturbance events. Finally, take rocket as the example， the rocket assembly space production scheduling system is developed, combining with the proposed algorithm. The practicability of the system is validated using real data.

Research on a Main-Branch Hybrid Flow Shop Scheduling Problem in Production Manufacturing System

2012 ◽  
Vol 252 ◽  
pp. 354-359
Author(s):  
Xin Min Zhang ◽  
Meng Yue Zhang
Keyword(s):  
Manufacturing System ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Scheduling Problem ◽  
Quantum Genetic Algorithm ◽  
Shop Scheduling ◽  
Scheduling Model ◽  
Hybrid Flow Shop Scheduling ◽  
Two Stages

A main-branch hybrid Flow shop scheduling problem in production manufacturing system is studied. Under the premise of JIT, targeting of smallest cost, a Flow-Shop production line scheduling model is built in cycle time of buffer. Two stages Quantum Genetic Algorithm (QGA) is proposed. By the results of numerical example, the effective and advantageous of QGA was shown.

scholarly journals Metaheuristics for Order Scheduling Problem with Unequal Ready Times

2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Jan-Yee Kung ◽  
Jiahui Duan ◽  
Jianyou Xu ◽  
I-Hong Chung ◽  
Shuenn-Ren Cheng ◽  
...  
Keyword(s):  
Real Life ◽  
Experimental Tests ◽  
Service Systems ◽  
Scheduling Problem ◽  
Due Dates ◽  
Order Scheduling ◽  
Customer Order ◽  
Scheduling Model ◽  
Unequal Ready Times ◽  
Customer Order Scheduling

In recent years, various customer order scheduling (OS) models can be found in numerous manufacturing and service systems in which several designers, who have developed modules independently for several different products, convene as a product development team, and that team completes a product design only after all the modules have been designed. In real-life situations, a customer order can have some requirements including due dates, weights of jobs, and unequal ready times. Once encountering different ready times, waiting for future order or job arrivals to raise the completeness of a batch is an efficient policy. Meanwhile, the literature releases that few studies have taken unequal ready times into consideration for order scheduling problem. Motivated by this limitation, this study addresses an OS scheduling model with unequal order ready times. The objective function is to find a schedule to optimize the total completion time criterion. To solve this problem for exact solutions, two lower bounds and some properties are first derived to raise the searching power of a branch-and-bound method. For approximate solution, four simulated annealing approaches and four heuristic genetic algorithms are then proposed. At last, several experimental tests and their corresponding statistical outcomes are also reported to examine the performance of all the proposed methods.

scholarly journals Realtime production scheduling and control systems in smart industry

Impact ◽  
2020 ◽  
Vol 2020 (8) ◽  
pp. 60-61
Author(s):  
Wei Weng
Keyword(s):  
Control Systems ◽  
Real Time ◽  
Production Scheduling ◽  
Production Control ◽  
Optimal Solution ◽  
Scheduling Problem ◽  
Optimal Solutions ◽  
Scheduling Problems ◽  
Smart Industry ◽  
And Control

For a production system, 'scheduling' aims to find out which machine/worker processes which job at what time to produce the best result for user-set objectives, such as minimising the total cost. Finding the optimal solution to a large scheduling problem, however, is extremely time consuming due to the high complexity. To reduce this time to one instance, Dr Wei Weng, from the Institute of Liberal Arts and Science, Kanazawa University in Japan, is leading research projects on developing online scheduling and control systems that provide near-optimal solutions in real time, even for large production systems. In her system, a large scheduling problem will be solved as distributed small problems and information of jobs and machines is collected online to provide results instantly. This will bring two big changes: 1. Large scheduling problems, for which it tends to take days to reach the optimal solution, will be solved instantly by reaching near-optimal solutions; 2. Rescheduling, which is still difficult to be made in real time by optimization algorithms, will be completed instantly in case some urgent jobs arrive or some scheduled jobs need to be changed or cancelled during production. The projects have great potential in raising efficiency of scheduling and production control in future smart industry and enabling achieving lower costs, higher productivity and better customer service.

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.

Sign in / Sign up

Export Citation Format

Share Document