| Summary: | 碩士 === 國立雲林科技大學 === 工業工程與管理系 === 105 === Intensive competition induces firms to improve the effectiveness on operational decisions by minimizing cost or maximizing profit. To satisfy the increases in order quantities, firms use multiple identical machines for production in each workstation, called“Flexible Flow-Shop” production system. Because production scheduling is associated with material deliveries, we consider an optimization problem regarding production scheduling and material delivery in a flexible flow-shop system. After the delivery of materials, the production will be proceeded. The production process is as follows: Vehicles carry materials to machines, and then, machines are activated for production. After the production, vehicles carry products to a destination. In this problem, we consider the due date of orders and capacity-limited buffers. To minimize the maximum production span, we formulate an integer linear programming model for solving production scheduling problem that determines order sequence and the delivery problem that determines the delivery assignment between vehicles and machines. Then, we develop a heuristics algorithm for optimization. Finally, we provide a sensitive analysis to discuss the performance of the proposed algorithm with respect to the changes of parameters and problem scale.
|
|---|
