| Summary: | 碩士 === 國立雲林科技大學 === 工業工程與管理研究所碩士班 === 100 === In make-to-order production systems, facing the influx of a large number of orders exceeds its load capacity, the manufacturers will give up some orders to fulfill the capacity requirement. Therefore, the order acceptance has become an important issue. Manufacturers must consider the levels of customers, the delivery time and benefits of each order to decide which orders to accept and what orders to give up based on their corresponding capacity to work out a reasonable scheduling project.
Therefore, this study investigates the single-machine scheduling problems in make-to-order systems, and all orders divided into three levels based on the importance of customers. Different level of orders has some scheduling restrictions, and affects the decisions to accept or give up orders. Some constraints such as a sequence-dependent setup time, release time and distinct due window are considered for each order. For each order, early completion will increase the holding cost, and delay in delivery will increase penalty as well; meanwhile, all orders must be completed before the deadline requirement. The objective is to meet the maximum the total profit of the system.
Constructed mathematical models can effectively solve our problem, but only for small size problems. The ISFAN, and the ISFAN + TS algorithms, both get excellent solution quality in this study. The ISFAN + TS under the variety of environments, the solution quality are better than ISFAN, and under the due date is more concentrated environment, but also can play the advantages of the solution. Finally, the overall improvement rate is 1.31%.
|
|---|
