2015.07.29 12:16
year | 1997 |
---|---|
author | Kichang Lee |
Keyword | Subcontract, Make-to-Order, MRP, Backward Scheduling, Forward Modification, Dynamic Programming |
Abstract | Customer satisfaction is becoming more and more important issue in enterprise environments these days. And meeting due-dates may be one of the most critical necessary conditions in satisfying cutomer needs. In this respect, many researchers have tried to develop good scheduling algorithms to observe due-dates. Most of these efforts tried to minimize some tardiness related measures by assigning heavy penalty costs when due-dates are violated while considering fixed production capacities. A more practical approach to circumvent the problem may be to use subcontracting mechanism. When production capacity is limited and due-date has to be obeyed, it is possible to use overtime, subcontract, etc. The production environment of this research may be considered as a flexible flow line, that is, a kind of flow shop with many parallel machines at each operation. The objective function of the problem is to minimize the subcontract cost while observing due-date and focusing on the possibilities of subcontracting. The solution methodology consists of two parts. First, we formulate the given problem by a mathematical model. And we propose an effective heuristic algorithm based on backward schedule generation and forward search & modification method. The experimental results of this heuristic for small size problem is also included, which is shown to be very fast and efficient. |
c | MS |
Download :