Dynamic rescheduling in a multiproduct batch processes with due-date penalties

การจัดเรียงลำดับการผลิตใหม่สำหรับกระบวนการผลิตแบบกะและค่าปรับจากการส่งผลิตภัณฑ์ล่าช้า

Name: Teerapon Chaninprasert

Organization : King Mongkut's University of Technology Thonburi. Faculty of Engineering. Chemical Engineering

keyword: Process control

; Batch Process

; กระบวนการผลิตแบบกะ

; Dynamic Rescheduling Algorithm

Abstract: Production scheduling is an important problem in batch chemical processes in which small-quantity but high-value products are manufactured and products follow the sameproduction path and share the batch equipment. The optimization arises from an attempt to locate an optimal production sequence, given N products to be manufactured, suchthat an objective function is minimized. One practical and relevant objective function is the total due-date penalty. Static or deterministic scheduling has been widely studied,whose models do not compensate for any external disturbances and internal disruptions that occur in a real plant. External disturbances often encountered are demand fluctuations, supply fluctuations and order cancellations or changes, while internal disruptions result fiom equipment failure, which call for a dynamic scheduling model.A new scheduling algorithm called Dynamic Rescheduling Algorithm (DRA) was developed and Simulated Annealing (SA) was proposed to solve the rescheduling problems with any unexpected events. DRA is built upon some existing heuristics as well as the idea of insertions and product enumeration that seek to reduce the total penalty. The performance of DRA and SA were evaluated with a large set of test problems including a direct comparison with Random Sampling (RS).The test results clearly showed RS to be a very poor method for solving the reschedding problem. Furthermore, the performance of DRA was found to be , compable to that of SA. On the average, the total penalty found by DRA was less than 1 percent higher than that of SA. At the same time, DRA only used about half the computation time as that in SA. In conclusion, SA and DRA are found to be effective: for solving the dynamic rescheduling problem, but DRA would be a better choice if the computation time is a major concern.

King Mongkut's University Technology Thonburi. Library

Address: กรุงเทพมหานคร (Bangkok)

Email: info.lib@mail.kmutt.ac.th

Name: Ku, Hong-ming

Role: Advisor

Created: 2004

Issued: 2007-07-18

Modified: 2007-07-26

วิทยานิพนธ์/Thesis

ISBN: 9741841574

CallNumber: CHE1528

eng

DegreeName: Master of Engineering

Level: Master's Degree

Descipline: Chemical Engineering

Grantor: King Mongkut's University of Technology Thonburi

©copyrights King Mongkut's University of Technology Thonburi

ลำดับที่.	ชื่อแฟ้มข้อมูล	ขนาดแฟ้มข้อมูล	จำนวนเข้าถึง	วัน-เวลาเข้าถึงล่าสุด
1	CHE1528.pdf	1.76 MB	57	2022-12-20 10:54:34
2	CHE1528ab.pdf	63.96 KB	25	2018-05-10 18:08:51
3	CHE1528ab.txt	2.15 KB	17	2018-05-10 18:08:52

ใช้เวลา

0.029431 วินาที