(A) heuristic algorithm for order promising with resource constraints in TFT-LCD manufacturing system

Abstract

In this thesis, we consider an order promising problem arising in TFT-LCD product manufacturing industry. An order has a weight, profit and due date and the order is composed of multiple products, each of which is produced by bill-of-materials (BOM). An order is fulfilled only when all product quantities for the order are satisfied. For maximizing profits over the planning horizon, we consider a situation in which customer orders in each period are given, all orders may not be accepted due to the limited resources, and each order can be accepted within two periods after due date of the order with penalty cost. Due to the complexity of the problem, we develop heuristic algorithms each of which is composed of two-step procedures. For the evaluation of performance of the proposed heuristics, a series of computational experiments was performed on randomly generated problem instances, and results showed that the proposed algorithms gave good or near-optimal solutions in a reasonable amount of time.