scholarly journals A Production Scheduling System for Batch Plants

1993 ◽  
Vol 29 (7) ◽  
pp. 843-850
Author(s):  
Shoji TOMITA ◽  
Shigeru FUJIMURA ◽  
Ryouichi HIMONO
2014 ◽  
Vol 889-890 ◽  
pp. 1207-1212
Author(s):  
Guo En Sun ◽  
Zai Lin Guan ◽  
Lei Yue ◽  
Zhi Ming Zheng ◽  
Han Lin

Traditional planning methods ignore the enterprise production capacity,the paper depend on the specific case in enterprise production to build a Production Scheduling System which applies Drum-Buffer-Rope theory. This system proposes the high output, low work in process and on time delivery as the goals, considering the bottleneck resource as well as providing the master production plan with the bottleneck resource, in addition employing the simulation optimization software-Simio to optimize the bottleneck process scheduling and raise the utilization ratio of bottleneck resource.


2021 ◽  
Vol 1 (2) ◽  
pp. 46-51
Author(s):  
Dwi Ayu Lestari, Vikha Indira Asri

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.


OR Spectrum ◽  
2002 ◽  
Vol 24 (3) ◽  
pp. 251-279 ◽  
Author(s):  
Klaus Neumann ◽  
Christoph Schwindt ◽  
Norbert Trautmann

2014 ◽  
Vol 496-500 ◽  
pp. 1617-1621
Author(s):  
Bin Ge ◽  
Jiang Hong Han ◽  
Zhen Wei ◽  
Lei Cheng

An intelligent preparation system model of enterprise railway shunting plan was described, and a station-based data structure was established. Through combining vehicle group and discussing route search method, a new thought of algorithm design and project of system implementation was given. A new strategy was proposed for optimizing model and algorithm of enterprise railway transport production scheduling.


2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
Leandro Pereira dos Santos ◽  
Guilherme Ernani Vieira ◽  
Higor Vinicius dos R. Leite ◽  
Maria Teresinha Arns Steiner

The main objective of a production scheduling system is to assign tasks (orders or jobs) to resources and sequence them as efficiently and economically (optimised) as possible. Achieving this goal is a difficult task in complex environment where capacity is usually limited. In these scenarios, finding an optimal solution—if possible—demands a large amount of computer time. For this reason, in many cases, a good solution that is quickly found is preferred. In such situations, the use of metaheuristics is an appropriate strategy. In these last two decades, some out-of-the-shelf systems have been developed using such techniques. This paper presents and analyses the development of a shop-floor scheduling system that uses ant colony optimisation (ACO) in a backward scheduling problem in a manufacturing scenario with single-stage processing, parallel resources, and flexible routings. This scenario was found in a large food industry where the corresponding author worked as consultant for more than a year. This work demonstrates the applicability of this artificial intelligence technique. In fact, ACO proved to be as efficient as branch-and-bound, however, executing much faster.


Sign in / Sign up

Export Citation Format

Share Document